Revision as of 18:37, 2 March 2011 edit 153.31.113.26 (talk) No edit summary ← Previous edit		Revision as of 18:38, 2 March 2011 edit undo 153.31.113.26 (talk) No edit summary Next edit →
Line 3: This algorithm differs from [[scoreboarding]] in that it utilizes [[register renaming]]. Where scoreboarding resolves Write-after-Write (WAW) and Write-after-Read (WAR) [[Hazard (computer architecture)\|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. ==Implementation concepts== The following are the concepts necessary to the implementation of Tomasulo's Algorithm.

Tomasulo's algorithm: Difference between revisions