Classical 5 pipeline give me a b c d e f answers

1. Classical 5 stage pipeline: Assuming the classical 5-stage pipeline with no forwarding except registers. Assume all of these instructions except Loads are integer and execute in I cycle and that 3 cycles. Given the code below: Loads take loopl: LD loop2: LD F6, 0 (R1) F8, 0 (R2) ADD F6, F6, F8 DADDIU R2, R2, +8 BNE R2, R6, loop2 DADDIU R1, R1, +8 BNE R1, R4, loopl (a) (4 pts) What are the stalls? mark them on the code listing above. (b) If we assume the branch is predicted as not taken and there is extra hardware in the decode stage, what is the penalty for each misprediction? (c) How many stalls are there in one iteration of the loop? (assuming the branch is mis predicted) (d) (3 points) Unroll the inner loop once and schedule the code to eliminate as many stalls as possible. (e) (3 points) Identify a place where forwarding could help and explain in detail how the forwarding condi- tion would be recognized and which pipeline register/field the data would be forwarded from. In the unrolled case the stall in the ADD waiting on R8 can be avoided by passing the result from Ex/M.ALUoutput to ALUinputB (0) How many stalls are there in one iteration with full forwarding (assuming the branch is mis predicted)