Early Register Deallocation Mechanisms Using Checkpointed Register Files

Oguz Ergin, Deniz Balkan, Dmitry Ponomarev, Kanad Ghose

Research output: Contribution to journalArticlepeer-review

Abstract

Modern superscalar microprocessors need sizable register files to support a large number of in-flight instructions for exploiting instruction level parallelism (ILP). An alternative to building large register files is to use a smaller number of registers, but manage them more effectively. More efficient management of registers can also result in higher performance if the reduction of the register file size is not the goal. Traditional register file management mechanisms deallocate a physical register only when the next instruction writing to the same destination architectural register commits. In this paper, we propose several techniques for deallocating physical registers much earlier. Our designs rely on the use of a checkpointed register file (CRF), where a local shadow copy of each bitcell is used to temporarily save the values of the early deallocated registers should they be needed to recover from branch mispredictions or to reconstruct the precise state after exceptions or interrupts. The proposed techniques try to release registers as soon as possible and are more aggressive than the previously proposed schemes for early deallocation of registers
Original languageEnglish
Pages (from-to)1153-1166
Number of pages14
JournalIEEE Transactions on Computers
Volume55
Issue number9
DOIs
Publication statusPublished - 2006

Fingerprint

Dive into the research topics of 'Early Register Deallocation Mechanisms Using Checkpointed Register Files'. Together they form a unique fingerprint.

Cite this