This preview shows pages 1–3. Sign up to view the full content.
This preview has intentionally blurred sections. Sign up to view the full version.View Full Document
Unformatted text preview: Consider the following instruction sequence: sub $2, $4, $5 beq $2, $3, somewhere Why doesnt this code sequence work properly on this hardware (this is a bug in the book!)? 3. Enhance the data path so that the code sequence of (2) works. Dont worry about control: 4. Suppose that the execute stage of the original hardware (figure 6.51) was the critical path (longest stage). What is the critical path after the modification for question #3 (be careful!)?...
View Full Document
This homework help was uploaded on 01/29/2008 for the course CS 152 taught by Professor Kubiatowicz during the Fall '04 term at University of California, Berkeley.
- Fall '04
- Computer Architecture