Cost effective physical register sharing
Authors:
- 1 March 2016
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 694-706
Abstract
Sharing a physical register between several instructions is needed to implement several microarchitectural optimizations. However, register sharing requires modifications to the register reclaiming process: Committing a single instruction does not guarantee that the physical register allocated to the previous mapping of its architectural destination register is free-able anymore. Consequently, a form of register reference counting must be implemented. While such mechanisms (e.g., dependency matrix, per register counters) have been described in the literature, we argue that they either require too much storage, or that they lengthen branch misprediction recovery by requiring sequential rollback. As an alternative, we present the Inflight Shared Register Buffer (ISRB), a new structure for register reference counting. The ISRB has low storage overhead and lends itself to checkpoint-based recovery schemes, therefore allowing fast recovery on pipeline flushes. We illustrate our scheme with Move Elimination (short-circuiting moves) and an implementation of Speculative Memory Bypassing (short-circuiting store-load pairs) that makes use of a TAGE-like predictor to identify memory dependencies. We show that the whole potential of these two mechanisms can be achieved with a small register tracking structure.Keywords
This publication has 22 references indexed in Scilit:
- Practical data value speculation for future high-end processors2014
- RENO: a rename-based instruction optimizer2005
- Continuous optimization2005
- Picking statistically valid and early simulation points2004
- Three extensions to register integration2003
- Checkpoint processing and recovery: towards scalable large instruction window processors2003
- Memory dependence prediction using store sets2002
- Load and store reuse using register file contents2001
- Virtual-physical registers1998
- Dynamic instruction reuse1997