Answer Happy

Computer Architecture: DO NOT SPAM. DO NOT GIVE SPAM ANSWERS>
PLZ SOLVE TRUTHFULLY:
Q3: (5 marks) Complete the following table using Tomasulo's Algorithm. Register all the stalls in the Comments column. Assume we have an infinite no. of reservation stations available with us. Observe the following lengths for different execution units: FP ADD/SUB: 4 CC FP MUL: 7 CC FP DIV: 40 CC INT ALU op: 1 CC LD/SD: 2CC IS EXE WR Comments (Mention different hazards stalling the pipeline) MUL.D F8, F6, F2 DIV.D F8, F2, F4 SUB.D F2, F8, F9 S.D F2, 0(R3) ADD.D F1, F2, F15 F1, 0(R7) L.D