solve problem $3$ Only Problem $2$:

Consider a dynamically scheduled single$-$issue processor that uses Tomasulo's algorithm with the following

execution latencies:

$3$ cycles for LD $(+1$ cycle for address computation$)$

$3$ cycles for SD $(+1$ cycle for address computation$)$

$1$ cycle for integer add$/$sub

$3$ cycles for double precision add $($ADDD$)$

$11$ cycles for double precision multiply $($MULTD$)$

$15$ cycles for double precision divide $($DIVD$)$

Also assume that the number of reservation stations we have for load, store, integer add$/$sub$,$ double

precision add$/$sub$,$ and double precision multiply$/$divide are $1,1,3,1,$ and $2$ respectively. Finally assume that

if two instructions are ready to write their results back in the same clock cycle, the priority will be given to

the oldest instruction $($based on program order$).$

Consider the program segment below:

Show the status of each instruction, the reservation stations $($including load$/$store buffers$),$ and the registers

status at cycle $12.$ How many cycles does it take for the program segment below to finish execution? For each

instruction show when it issues, when it finishes execution, and when it writes its result.

Problem $3$:

Repeat problem $2$ for a processor that uses Tomasulo's algorithm with speculation having a $5-$entries ROB.

For each instruction show when it issues, when it finishes execution, when it writes, and when it commits.