In this exercise, we examine how data dependences affect execution in the basic 5-stage pipeline described in Section 4.5. Problems in this exercise refer to the following sequence of instructions:
or r1, r2, r3
or r2, r1, r4
or r1, r1, r2
Also, assume the following cycle times for each of the options related to forwarding:
Without Forwarding 300ps
With Full Forwarding 300ps
With ALU-ALU Forwarding Only 290 ps
4.9.1 [10] <§4.5> Indicate dependences and their type.
4.9.2 [10] <§4.5> Assume there is no forwarding in this pipelined processor. Indicate hazards and add nop instructions to eliminate them.
4.9.3[10] <§4.5> Assume there is full forwarding. Indicate hazards and add nop instructions to eliminate them.
