Set-Dueling-Controlled Adaptive Insertion for High-Performance Caching

  • Authors:
  • Moinuddin K. Qureshi;Aamer Jaleel;Yale N. Patt;Simon C. Steely Jr.;Joel Emer

  • Affiliations:
  • IBM Research;Intel;The University of Texas at Austin;Intel;Intel

  • Venue:
  • IEEE Micro
  • Year:
  • 2008

Quantified Score

Hi-index 0.00

Visualization

Abstract

The commonly used LRU replacement policy causes thrashing for memory-intensive workloads. A simple mechanism that dynamically changes the insertion policy used by LRU replacement reduces cache misses by 21 percent and requires a total storage overhead of less than 2 bytes.