Computer Architecture 22200/32200 Homework #4
Due May 18th


  1. (32200 only, 20 points) Readings In Computer Architecture
    Explain how the authors handle branch prediction. Explain how the authors to handle interrupts.

  2. (32200 only, 10 points) Readings In Computer Architecture (32200 only)
    Explain how the author uses random access and small counters to handle branch prediction.
    Why does this scheme work well? When will it fail?

  3. (22200/32200, 60 points) Pipelining
    H&P A.1 (45 points) and H&P A.11 (15 points).
  4. (22200/32200, 40 points) Tomasulo's algorithm
    H&P 3.1a (10 points), H&P 3.3a (10 points), and H&P 3.6a (20 points).
  5. (22200 only, 15 points) Branch prediction
    H&P 3.10
  6. (32200 only, 20 points) Branch prediction
    H&P 3.11a
  7. (22200 only, 25 points) Speculation
    H&P 3.18
  8. (32200 only, 25 points) Speculation
    H&P 3.22

amr@cs.unchicago.edu May 2004