Pipeline Execution for Three Iterations Consider the following loop:.
loop: lw r1, 0(r1)
and r1, r1, r2
lw r1, 0(r1)
lw r1, 0(r1)
beq r1, r0, loop
Assume that perfect branch prediction is used (no stalls due to control hazards, we can run lw right after beq), branches resolve in the MEM stage, and that the pipeline has full forwarding support. Also assume that many iterations of this loop are executed before the loop exits.
1.1. Pipeline Execution Diagram
Show a pipeline execution diagram up to the third iteration of this loop. Start from the cycle in which we fetch the first instruction of that iteration. Go up to (but not including) the cycle in which we can fetch the first instruction of the next iteration. Show all instructions that are in the pipeline during these cycles (not just those from the third iteration, but also the tail end of the second iteration).
1.2. Pipeline Stage Utilization
How often (as a percentage of all cycles) do we have a cycle in which all five pipeline stages are doing useful work? Add the percent symbol in your solution with no space in-between (e. g. 45%).
Please explain