Question: The following code is run on a pipelined processor with full forwarding Loop addi $t0, $t0, 1 slt $t1, $t0, 10 bne $t1, $zero, loop
The following code is run on a pipelined processor with full forwarding
Loop addi $t0, $t0, 1 slt $t1, $t0, 10 bne $t1, $zero, loop addi $s0, $s0, 1 addi $s1, $s1, 1 addi $s2, $s2, 1
Assuming there is no branch prediction and branches are determine in the ME phase, populate the pipeline diagram using the compact notation (Use S for stalls). Write out the first two iterations of the loop.
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
