Computer Architecture CS 271
Popular in Course
Popular in ComputerScienence
This 0 page Study Guide was uploaded by Tad Vandervort on Sunday November 1, 2015. The Study Guide belongs to CS 271 at Indiana University Purdue University - Fort Wayne taught by Staff in Fall. Since its upload, it has received 39 views. For similar materials see /class/233548/cs-271-indiana-university-purdue-university-fort-wayne in ComputerScienence at Indiana University Purdue University - Fort Wayne.
Reviews for Computer Architecture
Report this Material
What is Karma?
Karma is the currency of StudySoup.
You can buy or earn more Karma at anytime and redeem it for class notes, study guides, flashcards, and more!
Date Created: 11/01/15
CS 271 1 Exam Study Guideline In general you need to study the material in the lecture slides and textbook This exam cover Chapterl Appendix 1 and Chapter 2 19 The exam usually includes TrueFall questions short answers to concepts and small problem and word problems as in the homework assignment The following concepts and theory should be focused 1 2 ws wew HHHH VIALAN eo NHHHH oxoooxlcx NNN LAND i NN UIlk NN ION LANN 0000 Understand each assigned homework and be able to nish each quickly Review the Check Yourself sections and compare your answers with the answers in the book Review Fallacies and Pitfalls of each chapter Five components of a computer datapath and control page 20 Processor chip Figure 19 instruction set architecture page 22 VLSI page 28 instruction set Section 21 registers word memory addresses how to address a byte and how to address a word 4bytes alignment restriction Section 23 Compiling using registers operand in memory load and store Section 23 spilling registers Section 23 instructions add sub addi lw sw refer to Figure 24 Translating a MIPS instruction into a machine instruction See examples in pages 61 65 we have done these many times in class using the Green Paper conversion between binary hexadecimal and decimal access array elements in memory assume each element is a word logical operations add addi or ori nor sll and srl instructions for making decision beq bne slt slti compile if ifthenelse while loop for loop MIPS machine language example Figure 213 procedure calling convention page 79 jal and jr instructions Program counter PC return address ra the relationship between PC and ra stack stack pointer page 80 and procedure frame and frame pointer page 86 Study carefully Section 27 especially examples compile a procedure that doesn t call another procedure argument passing return value store preserve old register values in stack in case the procedure modifies them restore the old register values Support nested procedure ra argument registers etc Figure 215 shows the convention for preserving the register in stack Allocate space for new data on the stack allocate space for new data on the heap Run facts available in website httpusersipfweduliudclasscs271f08LectureCS27lilectureireadinghtml Lecture and Reading in the SPIM how the PC starts from 0040 0000hex and refer to Figure 217 here 31 Section 29 32bit immediate operands addressing in branches and jumps 32 PCrelative addressing and example in pp 9899 33 Reverse assembly from machine instruction to MIP assembly instruction example in page102 34 MIPS addressing modes page 101 35 MIPS instruction format in Figure 226
Are you sure you want to buy this material for
You're already Subscribed!
Looks like you've already subscribed to StudySoup, you won't need to purchase another subscription to get this material. To access this material simply click 'View Full Document'