Flexible register management using reference counting

Conventional out-of-order processors that use a unified physical register file allocate and reclaim registers explicitly using a free list that operates as a circular queue. We describe and evaluate a more flexible register management scheme—reference counting. We implement reference counting using a bit-matrix with a column for every physical register and a row for every entity that can hold a physical register, e.g., an in-flight instruction. Columns are NOR’ed together to create a bitvector free list from which registers are allocated using priority encoders. We describe reference counting designs that support micro-architectural techniques including register file power gating, dynamic register move elimination, register file checkpointing, and latency tolerant execution. Performance and circuit simulation show that the energy cost of reference counting is low and is easily recouped by the savings of the techniques it enables.

• Type: Journal
• Year: 2012
• Where: HPCA
• Authors: Steven Battle, Andrew D. Hilton, Mark Hempstead, Amir Roth
• Keywords: Circuit Simulation, Circular Queue, Distributed And Parallel Computing, Execution Performance, HPCA 2012