News
EveryChip

Out-of-order execution

Letting a processor run instructions as soon as their inputs are ready, not strictly in program order, then putting the results back in order.

Also: OoO, dynamic scheduling, register renaming

In-order processors stall whenever one instruction waits, for example for data from memory. An out-of-order core holds a window of upcoming instructions, runs any whose inputs are ready, and uses a reorder buffer to make the results appear in the original order. Register renaming removes false clashes between instructions that reuse the same register name. Robert Tomasulo's algorithm for the IBM System/360 Model 91 in 1967 laid the groundwork. The Pentium Pro of 1995 brought it to x86, and most high-performance cores now use it.

See also

Find chips that mention Out-of-order execution

The weekly digest

Every Monday: the chip of the day, new pages on EveryChip, and the conferences and anniversaries of the week ahead.