Objectives. Learn how instructions are pipelined and branches are predicted.

Solve the following problems. You must show your work in order to receive full credit.

$(1)$ Fill in the traditional pipeline diagram that shows in which cycle each of the instructions in problem $1$ will be in each stage of the $5-$stage MIPS pipeline discussed in class. $(25$ points$)$

$\backslash$table$[[$cycle$,1,2,3,4,5,6,7,8,9,10],[$or $$t4,$$$t2,$$$t4,,,,,,,,,,],[$lw $$t3,0($$$t4),,,,,,,,,,],[$add $$t5,$$$t3,$$$t2,,,,,,,,,,],[$sw $$t3,0($$$t5),,,,,,,,,,]]$

$(2)$ Consider a code sequence consisting of $100$ consecutive $1w$ instructions. Except for the first instruction, each instruction uses the register that was loaded in the previous instruction as shown below. What would be the total number of cycles required for this sequence of instructions to execute given the pipelined datapath of Figure $4\mathrm{.}65$ on page $325$ of your text? $(25$ points$)$

$Iw$ $$t2,0($$$t1)$

$1w$$$t2,0($$$t2)$

dots