CS252: Homework Assignment #1 Due Wednesday, October 22th

        3.3, 3.5, 3.6

        3.11, 3.17, 3.22, 3.28

        4.9, 4.10, 4.11, 4.13, 4.14

        4.16, 4.18, 4.20, 4.21

G.2, G.3, G.11: Click here for appendix G

Additional Question (call it 4.EX1):

a) What is the maximum number of physical registers that would be neccessary (for max performance) in a scoreboard machine with explicit register renaming? (ignore the overhead of trying to maintain precise interrupts).
b) Why would the above answer be different if precise interrupts were maintained? How would you estimate the max number of registers in this case?
c) How many total physical registers are available in a Tomasulo architecture that has implicit register renaming? (again ignore the reorder buffer).
Additional Question (call it 4.EX2):

 Consider a string of dependent instructions, i.e. :
      add r1, r2, r3
     sub r4, r1, r2
     add r5, r4, r2
     sub r6, r5, r2,    etc....
Assume that there is a huge (infinite) number of these instructions.  Assume that the adders/subtracters take 1 cycle to execute.

a) What is the best CPI that you could get with a scoreboard (as defined in the book)?
b) What is the best CPI that you could get with a Tomasulo organization (as defined in the book)?
c) Can you fix the Tomasulo architecture so that the above code sequence has a CPI of 1 without increasing the cycletime? (Hint: think in terms of pipelining the wakeup logic in the reservation stations)..

Study groups are encouraged, but pairs should do their own work.
 

Back to CS252 page