11: 12: 13: 14: 15: 16: Question 2: MIPS 5-stage Pipeline (35 pts) For this question, your first task is to write the MIPS instructions based on the provided machine codes. You may assume the first line of the code is stored at the memory location 1000. You might want to use the table to remember the Operation and Function code of different instructions. Please also remember the St0 is accessed with Register 8, St1 is accessed with Register 9, etc. 0x014B4820 0x014B6022 0x018D7020 0x018D7822 0x112E03E8 0x112E03F0 Instructions Add Subtract Add Immediate Load Word Store Word Jump Branch on Equal Branch on Not Equal Op. Code 0 0 8 35 43 2 45 Fcn. Code 32 34 N.A. N.A. N.A. N.A. N.A. N.A. (a) Please use the above space next to the machine code to write down the MIPS code. No partial credit! (b) Assume you run the code, and discuss what could go wrong by assigning non-negative integers to the registers as a test case. (c) Calculate how many clock cycles will take the execution of this segment on the simple pipeline without forwarding when the result of the branch instruction (new PC content) is available after the WB stage. Show the timing of one loop cycle in the Figure below. No partial credit! 1 2 3 4 5 678 9 10 11 12 13 14 15 16 17 18 19 20 (d) Discuss what would be different from part (c) if we enable forwarding. 11: 12: 13: 14: 15: 16: Question 2: MIPS 5-stage Pipeline (35 pts) For this question, your first task is to write the MIPS instructions based on the provided machine codes. You may assume the first line of the code is stored at the memory location 1000. You might want to use the table to remember the Operation and Function code of different instructions. Please also remember the St0 is accessed with Register 8, St1 is accessed with Register 9, etc. 0x014B4820 0x014B6022 0x018D7020 0x018D7822 0x112E03E8 0x112E03F0 Instructions Add Subtract Add Immediate Load Word Store Word Jump Branch on Equal Branch on Not Equal Op. Code 0 0 8 35 43 2 45 Fcn. Code 32 34 N.A. N.A. N.A. N.A. N.A. N.A. (a) Please use the above space next to the machine code to write down the MIPS code. No partial credit! (b) Assume you run the code, and discuss what could go wrong by assigning non-negative integers to the registers as a test case. (c) Calculate how many clock cycles will take the execution of this segment on the simple pipeline without forwarding when the result of the branch instruction (new PC content) is available after the WB stage. Show the timing of one loop cycle in the Figure below. No partial credit! 1 2 3 4 5 678 9 10 11 12 13 14 15 16 17 18 19 20 (d) Discuss what would be different from part (c) if we enable forwarding.