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

FIGURE 3.8 Multiply and divide are the only instructions not finished .
Tomasulo's Algorithm: The Details
Figure 3.9 specifies the checks and steps that each instruction must go through. As mentioned
earlier, loads and stores go through a functional unit for effective address computation before
proceeding to independent load or store buffers. Loads take a second execution step to access
memory and then go to write result to send the value from memory to the register file and/
or any waiting reservation stations. Stores complete their execution in the write result stage,
which writes the result to memory. Notice that all writes occur in write result, whether the