Use-Based Register Caching with Decoupled Indexing

  • Authors:
  • J. Adam Butts;Gurindar S. Sohi

  • Affiliations:
  • University of Wisconsin-Madison;University of Wisconsin-Madison

  • Venue:
  • Proceedings of the 31st annual international symposium on Computer architecture
  • Year:
  • 2004

Quantified Score

Hi-index 0.01

Visualization

Abstract

Wide, deep pipelines need many physical registersto hold the results of in-flight instructions. Simultaneously,high clock frequencies prohibit using largeregister files and bypass networks without a significantperformance penalty. Previously proposed techniquesusing register caching to reduce this penalty sufferfrom several problems including poor insertion andreplacement decisions and the need for a fully-associativecache for good performance. We present novelmechanisms for managing and indexing register cachesthat address these problems using knowledge of thenumber of consumers of each register value.The insertion policy reduces pollution by not cachinga register value when all of its predicted consumersare satisfied by the bypass network. The replacementpolicy selects register cache entries with the fewestremaining uses (often zero), lowering the miss rate. Wealso introduce a new, general method of mapping physicalregisters to register cache sets that improves theperformance of set-associative cache organizations byreducing conflicts. Our results indicate that a 64-entry,two-way set associative cache using these techniquesoutperforms multi-cycle monolithic register files andpreviously proposed hierarchical register files.