Instruction-Level Parallelism and Its Exploitation - Computer Architecture: A Quantitative Approach - page 169

3.5 Dynamic Scheduling: Examples and the Algorithm
Before we examine Tomasulo's algorithm in detail, let's consider a few examples that will help
illustrate how the algorithm works.

Example
Show what the information tables look like for the following code sequence
when only the irst load has completed and writen its result:
1. L.D F6,32(R2)

2. L.D F2,44(R3)

3. MUL.D F0,F2,F4

4. SUB.D F8,F2,F6

5. DIV.D F10,F0,F6

6. ADD.D F6,F8,F2

Answer
Figure 3.7 shows the result in three tables. The numbers appended to the names
Add, Mult, and Load stand for the tag for that reservation station—Add1 is the
tag for the result from the first add unit. In addition, we have included an in-
struction status table. This table is included only to help you understand the al-
gorithm; it is not actually a part of the hardware. Instead, the reservation station
keeps the state of each operation that has issued.