COMPUTER ARCHITECTURE AND ORGANIZATION: An ... - IIUSA

More documents

Recommendations

Info

moved: addcc %r0, 1, %r5 st %r5, %r9 st %r1, [old_x] st %r2, [old_y] ba loop flash: #FFFFEC ! Location of flash register joy_x: #FFFFF0 ! Location of joystick x register joy_y: #FFFFF4 ! Location of joystick y register old_x: 0 ! Previous x position old_y: 0 ! Previous y position .end (4-3) (4-4) There is more than one solution. Here is one: 0000011 001 001 101 CHAPTER 5 SOLUTIONS (5-1) Note that %r1 goes in the rd field for an st instruction: 11 00001 000100 00010 0 00000000 00011 op rd op3 rs1 i rs2 DECODE: 1 11 000100 00 = 1808 Microinstructions: 0, 1, 1808, 1809, 40, 41, 42, 43, 44, 2047
(5-2) 1615: 000000 1 000000 0 100010 0 0 0 0001 110 00000010101 21: 100001 0 100001 0 100011 0 0 0 0010 000 00000000000 (5-3) 00000000 00000000 0 00 00000000 0 00000111 00000011 0 01 00010101 0 11111111 11111111 1 11 11111110 1 CHAPTER 6 SOLUTIONS (6-1) The important point in making the translation to SPARC is how to manipulate the stack frame. Prior to the function call, the calling routine places the parameters on the stack. When the called routine (min) is invoked, its first task should be to save the return address on the stack. There is no need to do it here since min makes no nested calls. So, the stack pointer currently points to j, and i is one word deeper into the stack: addcc %r14, -4, %r14 ! Push m onto stack frame ld %r14, 8, %r1 ! r1
Page 1 and 2: COMPUTER ARCHITECTURE AND ORGANIZAT
Page 3 and 4: CHAPTER 3 PROBLEMS (3-1) Show the r
Page 5 and 6: (a) How large can the stack grow, i
Page 7 and 8: CHAPTER 5 PROBLEMS (5-1) List the m
Page 9 and 10: All numbers are given in base 10 K
Page 11 and 12: CHAPTER 7 PROBLEMS (7-1) A cache ha
Page 13 and 14: Present bit Page frame field Page #
Page 15 and 16: (a) Compute the checksum word for t
Page 17 and 18: (A) 16 (B) 64 (C) 256 (D) 512 (E) 1
Page 19 and 20: (A) D 1 = Q 1 'Q 2 'Q 3 ' D 2 = Q 1
Page 21 and 22: (2-8) 0 1 0 0 0 0 1 0 1 . 1 0 1 0 1
Page 23: 0 0 0-1 1 0-1 0 Booth recoded multi
Page 27 and 28: (7-3) < page# >< offset > 2050 = 0
Page 29 and 30: 107 (9×7 + 9r + 1)
Page 31 and 32: (A-11) There is more than one solut

COMPUTER ARCHITECTURE AND ORGANIZATION: An ... - IIUSA

Create successful ePaper yourself

Delete template?

Save as template?