Register renaming (2)
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 rear of the reorder buffer
At end of execution 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 physical register.
Still need of a mapping table