Common · Knowledge
Tomasulo's algorithm
Computer architecture hardware algorithm
Tomasulo's algorithm is a computer architecture hardware algorithm for dynamic scheduling of instructions that allows out-of-order execution and enables more efficient use of multiple execution units. It was developed by Robert Tomasulo at IBM in 1967 and was first implemented in the IBM System/360 Model 91's floating-point unit.
From Wikipedia
Tomasulo's algorithm is a computer architecture hardware algorithm for dynamic scheduling of instructions that allows out-of-order execution and enables more efficient use of multiple execution units. It was developed by Robert Tomasulo at IBM in 1967 and was 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 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 execution of instructions that would otherwise stall under the use of scoreboarding or other earlier algorithms. Robert Tomasulo received the Eckert–Mauchly Award in 1997 for his work on the algorithm.
Text: Wikipédia, CC BY-SA 4.0. ·
Related cards
-
T★★★
Timsort
Hybrid sorting algorithm based on insertion sort and merge sort
-
★
PLATO (computer system)
Mainframe computer system
-
S★★★
Shor's algorithm
Quantum algorithm for integer factorization
-
★★★
Bogosort
Highly ineffective sorting algorithm that successively generates permutations of its input until it finds one that is sorted
-
I★★
Introduction to Algorithms
Book on computer programming
-
★
Schönhage–Strassen algorithm
Multiplication algorithm