Register renaming – Scheme 2; Reorder buffer

• Use of a reorder buffer

  • Reorder buffer = circular queue with head and tail pointers

• At issue (renaming time), an instruction is assigned an entry at the tail of the reorder buffer which becomes the name of (or a pointer to) the result register

• At end of functional-unit computation, value is put in the instruction reorder buffer’s position

• When the instruction reaches the head of the buffer, its value is stored in the logical or physical (other reorder buffer entry) register.

• Still need of a mapping table

Previous slide

Next slide

Back to first slide

View graphic version