Section 1: Pipelining (25 points) Assume a processor that implements five stage pipelining where each stage takes 5ns Consider the following program: If (Ro == R2) {Ro = Ro + Ri} else {R3 = R2 + Rs} R4 = Ro + RT RQ = R3 + R1 Assume R1 + R2. 1. Compute the total time needed for sequential execution (no pipelining). (2 points) 2. Identify the hazards in the program (3 points) 3. Complete the pipelining diagram for the program where forwarding is not allowed. Justify briefly your decisions (1 line each). (10 points) 4. Find the total time of execution after pipelining (2 points) 5. Find the saving percentage due to pipelining (2 points). 6. Repeat b when forwarding is allowed (6 points). Section 1: Pipelining (25 points) Assume a processor that implements five stage pipelining where each stage takes 5ns Consider the following program: If (Ro == R2) {Ro = Ro + Ri} else {R3 = R2 + Rs} R4 = Ro + RT RQ = R3 + R1 Assume R1 + R2. 1. Compute the total time needed for sequential execution (no pipelining). (2 points) 2. Identify the hazards in the program (3 points) 3. Complete the pipelining diagram for the program where forwarding is not allowed. Justify briefly your decisions (1 line each). (10 points) 4. Find the total time of execution after pipelining (2 points) 5. Find the saving percentage due to pipelining (2 points). 6. Repeat b when forwarding is allowed (6 points)