Hardware schemes for early register release
- 1 January 2002
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 01903918,p. 5-13
Abstract
Register files are becoming one of the critical components of current out-of-order processors in terms of delay and power consumption, since their potential to exploit instruction-level parallelism is quite related to the size and number of ports of the register file. In conventional register renaming schemes, register releasing is conservatively done only after the instruction that redefines the same register is committed. Instead, we propose a scheme that releases registers as soon as the processor knows that there will be no further use of them. We present two early releasing hardware implementations with different performance/complexity trade-offs. Detailed cycle-level simulations show either a significant speedup for a given register file size, or a reduction in register file size for a given performance level.Keywords
This publication has 14 references indexed in Scilit:
- Inherently lower-power high-performance superscalar architecturesIEEE Transactions on Computers, 2001
- Instruction distribution heuristics for quad-cluster, dynamically-scheduled, superscalar processors2000
- The design space of register renaming techniquesIEEE Micro, 2000
- The Alpha 21264 microprocessorIEEE Micro, 1999
- Software-directed register deallocation for simultaneous multithreaded processorsIEEE Transactions on Parallel and Distributed Systems, 1999
- One billion transistors, one uniprocessor, one chipComputer, 1997
- The Mips R10000 superscalar microprocessorIEEE Micro, 1996
- The 16-fold way: a microparallel taxonomy1993
- Checkpoint repair for out-of-order execution machines1987
- Look-Ahead ProcessorsACM Computing Surveys, 1975