A novel dynamic register renaming approach is proposed in this work. The key idea of the novel scheme is to delay the allocation of physical registers until a late stage in the pipeline, instead of doing it in the decode stage as conventional schemes do. In this way, the register pressure is reduced and the processor can exploit more instruction-level parallelism. Delaying the allocation of physical registers require some additional artifact to keep track of dependences. This is achieved by introducing the concept of virtual-physical registers, which do not require any storage location and are used to identify dependences among instructions that have not yet allocated a register to its destination operand. Two alternative allocation strategies have been investigated that differ in the stage where physical registers are allocated: issue or write-back. The experimental evaluation has confirmed the higher performance of the latter alternative. We have performed all evaluation of the novel scheme through a detailed simulation of a dynamically scheduled processor. The results show a significant improvement (e.g., 19% increase in IPC for a machine with 64 physical registers in each file) when compared with the traditional register renaming approach. ; Peer Reviewed ; Postprint (published version)
Virtual-physical registers
1998-01-01
Miscellaneous
Electronic Resource
English
Àrees temàtiques de la UPC::Informàtica::Arquitectura de computadors , Microprocessors , Parallel processing (Electronic computers) , Processor scheduling , Virtual storage , Storage allocation , Software performance evaluation , Naming services , Instruction sets , Microprogramming , Microprocessadors , Processament en paral·lel (Ordinadors)
DDC: | 629 |
Online Contents | 1998
Online Contents | 2001
Online Contents | 2001
Online Contents | 2002
Online Contents | 2001