CSE 378 - Spring 1998

Machine Organization and Assembly Language Programming

Problem Set #6

Due Monday, May 18, 1998

• Do the following problems, and hand in the answers by the start of class on Monday, May 18.

1. Problem 6.4
2. Problem 6.12
3. Problem 6.13
4. Problem 6.19
5. Problem 6.28
6. Problem 6.30
7. Assume that memory accesses have become the critical path in the implementation of our architecture, so we have deepened the pipeline from 5 stages to 7:

IF1 IF2 ID EX MEM1 MEM2 WB

Which stages' outputs may need to be forwarded back to which other inputs?  What is the maximum number of stages "back" we will need to forward data (i.e. to the previous stage, 2 stages earlier, etc.)?

Redraw Figure 6.36 (using the instructions provided in the figure) to reflect the execution of this instructions under the new pipeline structure.  Show all cycles until the instruction sequence completes.