Tomasulo's algorithm: Difference between revisions

Revision as of 20:08, 8 September 2017

Revision as of 07:38, 19 October 2017

Line 1:

'''Tomasulo’s algorithm''' is a [[computer architecture]] hardware [[algorithm]] for dynamic scheduling of instructions that allows [[out-of-order execution]], designed to efficiently utilizeuse multiple execution units. It was developed by [[Robert Tomasulo]] at [[IBM]] in 1967, and first implemented in the [[IBM System/360 Model 91]]’s [[floating point unit]].

The major innovations of Tomasulo’s algorithm include [[register renaming]] in hardware, [[reservation station|reservation stations]] for all execution units, and a common data bus (CDB) on which computed values broadcast to all reservation stations that may need them. These developments allow for improved [[parallel computing|parallel execution]] of instructions that would otherwise stall under the use of [[scoreboarding]] or other earlier algorithms.