Complexity-Effective rename table design for rapid speculation recovery

Authors:
Görkem Aşılıoğlu;Emine Merve Kaya;Oğuz Ergin
Affiliations:
TOBB University of Economics and Technology, Ankara, TÜRKİYE;TOBB University of Economics and Technology, Ankara, TÜRKİYE;TOBB University of Economics and Technology, Ankara, TÜRKİYE
Venue:
ARCS'10 Proceedings of the 23rd international conference on Architecture of Computing Systems
Year:
2010

Citing 5
Cited 0

Checkpoint repair for out-of-order execution machines

ISCA '87 Proceedings of the 14th annual international symposium on Computer architecture
The MIPS R10000 Superscalar Microprocessor

IEEE Micro
The Alpha 21264 Microprocessor

IEEE Micro
The Design Space of Register Renaming Techniques

IEEE Micro
Checkpoint Processing and Recovery: Towards Scalable Large Instruction Window Processors

Proceedings of the 36th annual IEEE/ACM International Symposium on Microarchitecture

Quantified Score

Hi-index	0.00

Visualization

Abstract

Register renaming is a widely used technique to remove false data dependencies in contemporary superscalar microprocessors. The register rename logic includes a mapping table that holds the physical register identifiers assigned to each architectural register. This mapping table needs to be recovered to its correct state when a branch prediction occurs. In this paper we propose a scalable rename table design that allows fast recovery on branch predictions. A FIFO scheme is applied with a distributed rename table structure that holds a variable number of checkpoints specific to each architectural register. Our results show that although the area of the rename table is increased, it is possible to recover from a branch misprediction in at worst 2 cycles.