Question $3$

This question considers the basic MIPS $5-$stage pipeline $($F$,$ D$,$ E$,$ M$,$ W$).$ Assume that there is full forwarding for all questions.

Show how the instructions in the sequence given below will proceed through the pipeline.

Assume the following:

We will predict that the beq instruction as not taken.

Branch address calculation and condition are resolved in the $D$ stage.

When the beq instruction is executed, the value in $R1$ is equal to the value in R$2.$

$\backslash$table$[[,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15],[$beq R$1,$R$2,$L$,,,,,,,,,,,,,,,],[$Iw R$10,0($R$11),,,,,,,,,,,,,,,],[$sub R$7,$R$3,$R$3,,,,,,,,,,,,,,,],[\backslash$table$[[$L: add$],[$R$4,$R$1,$R$2]],,,,,,,,,,,,,,,],[$Iw R$1,0($R$4),,,,,,,,,,,,,,,],[$sub R$1,$R$1,$R$1,,,,,,,,,,,,,,,],[$add R$1,$R$1,$R$1,,,,,,,,,,,,,,,]]$