$)$

a$.$ What does this program fragment do$?(1-2$ sentences$)$

b$.$ How many iterations does this loop execute before it exits? One iteration is defined as executing all the instructions in the loop once.

c$.$ How many cycles will it take to execute the code fragment on this non$-$pipelined machine?

path are killed, so the correct instruction is delayed $($this is not called a stall, but is called a delay$).$ Branch conditions are evaluated when the branch instruction reaches the execute stage.

that stalls, depending on the type of the hazard which caused it to stall $($not what type it causes!$).$ If the number of stall cycles is not the same in each iteration, show the common case.

instruction can be fetched.

instruction reaches the execute stage.

g$.$ How many cycles does the program take to execute on this improved pipeline? As before, take care that not all iterations may take an equal number cycles to execute.

h$.$ What is the speedup for this improved real pipeline vs a non$-$pipelined machine on this code?