Slide 50:

Suppose we have a 5-stage MIPS pipeline with all possible forwarding. Branches work as described up to Chapter 4 Slide 67,ie., branch condition and target address are calculated in ID. Consider this MIPS loop: loop:lw 17, 0(516) lw $12, 0 (517) sub $12, $12, $14 add $20, $20, $12 Do not change the order of the instructions. Show timing of this MIPS instruction sequence through the pipeline. Show all stalls clearly, and mark with arrows all cases where forwarding takes place, as in our lectures. (See for example Chapter 4 Slide 50.) In addition, state clearly how ForwardA and ForwardB are set in the cycles where forwarding takes place (as discussed in class). For example: Cycle 1 ForwardA 01