Address compression through base register caching

  • Authors:
  • Arvin Park;Matthew Farrens

  • Affiliations:
  • Division of Computer Science, University of California, Davis, CA;Division of Computer Science, University of California, Davis, CA

  • Venue:
  • MICRO 23 Proceedings of the 23rd annual workshop and symposium on Microprogramming and microarchitecture
  • Year:
  • 1990

Quantified Score

Hi-index 0.00

Visualization

Abstract

This paper presents a technique to reduce processor-to-memory address bandwidth by exploiting temporal and spatial locality in address reference streams. Higher order portions of address words are cached in base registers at both the processor and memory. This makes it possible to transmit small register indexes between processor and memory instead of the high order address bits themselves. Trace driven simulations indicate that Base Register Caching reduces processor-to-memory address bandwidth up to 60% without appreciable loss in performance.