The Tomasulo algorithm is a hardware algorithm developed in 1967 by Robert Tomasulo from IBM. It allows sequential instructions that would normally be stalled due to certain dependencies to execute non-sequentially (out-of-order execution). It was first implemented for the IBM System/360 Model 91’s floating point unit.
This algorithm differs from scoreboarding in that it utilizes register renaming. Where scoreboarding resolves Write-after-Write (WAW), Read-after-Write (RAW) and Write after Read (WAR) hazards by stalling, register renaming allows the continual issuing of instructions. The Tomasulo algorithm also uses a common data bus (CDB) on which computed values are broadcast to all the reservation stations that may need it. This allows for improved parallel execution of instructions which may otherwise stall under the use of scoreboarding.
Robert Tomasulo received the Eckert-Mauchly Award in 1997 for this algorithm.
Other articles related to "tomasulo algorithm":
... A re-order buffer (ROB) is used in a Tomasulo algorithm for out-of-order instruction execution ... In Tomasulo algorithm, an additional stage called "commit" came up ... It can also be accessed from the side - each reservation station (in Tomasulo algorithm) has an additional parameter, which points to instruction in ROB ...