Problem 2 [230 Points]: Basic pipelining with forwarding Consider the following MIPS code: 11: DADD R1, R5, R3 12: DADD R3, R1, R5 13: 14: DADD R5, R1, R3 SD R5, 10(R1) Suppose we have the simple MIPS 5-stage pipeline discussed in the book and the lectures (and every instruction must go through all 5 stages). (a) (120 points) Fill in the following pipeline table showing execution of the instructions assuming that full forwarding and bypassing being used. 1 2 3 4 5 6 7 8 9 10 11 12 13 | IF | ID | EX | MEM | WB 11 12 14 1? (b) (10 points) If the clock frequency is 1 GHZ. How long does it take to execute these four instructions? o00 G H l000 (c) (30 points) How many total stall cycles are needed to execute these instructions? What is the CPI of these instructions and what is the IPC? no skall