Question: Assuming Tomasulo's Algorithm is implemented in the following CPU without reorder buffer.Initially, R 1 = 1 0 0 0 , and Fx = x (

Assuming Tomasulo's Algorithm is implemented in the following CPU without reorder buffer.Initially, R1=1000, and Fx = x (e.g., F0=0, F2=2, etc). Show the contents in both reservation stationsafter enough long time but the load instruction is still waiting for the results from memory. Use the name SB, LB, RSADD, RSMUL to represent store buffer, load buffer, reservation station for adder, and reservation station for multiplier, respectively.

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Databases Questions!