Re-order buffer
A re-order buffer (ROB) is used in a Tomasulo algorithm for out-of-order instruction execution. It allows instructions to be committed in-order.
Additional benefits include allowing for precise exceptions and easy rollback for control of target address mispredictions (branch or jump).
External links
 | This April 2007's use of external links may not follow Wikipedia's policies or guidelines. |
- Article "Reorder Buffer" by Louis G. Johnson
- Article "Design and implementation of a 100 MHz reorder buffer" by Steven Wallace, Nirav Dagli and Nader Bagherzadeh
- Paper "Low-Complexity Reorder Buffer Architecture" (323 KB) by Gurhan Kucuk, Dmitry Ponomarev and Kanad Ghose
- Paper "Energy-Efficient Design of the Reorder Buffer" by Dmitry Ponomarev, Gurhan Kucuk and Kanad Ghose
- Paper "The Impact of Fetch Rate and Reorder Buffer Size On Speculative Pre-Execution" (211 KB) by David M. Koppelman
- Paper "A Comparative Analysis of Packet Reordering Metrics" by Nischal M. Piratla, Anura P. Jayasumana and Abhijit Bare
- United States Patent "Reorder buffer having an improved future file for storing speculative instruction execution results" by David B. Witt and Thang M. Tran
- Chapter "Reorder Buffers and Register Renaming" by N. A. Harman
- Description of reorder buffer entries
- Method and Apparatus for Efficient Reorder Buffer Assignment
 | This computer science article is a stub. You can help Wikipedia by expanding it. |