Adaptive insertion policies for high performance caching

摘要: The commonly used LRU replacement policy is susceptible to thrashing for memory-intensive workloads that have a working set greater than the available cache size. For such applications, majority of lines traverse from MRU position without receiving any hits, resulting in inefficient use space. Cache performance can be improved if some fraction retained so at least contribute hits.We show simple changes insertion significantly reduce misses workloads. We propose Insertion Policy (LIP) which places incoming line instead position. LIP protects and results close optimal hitrate applications cyclic reference pattern. also Bimodal (BIP) as an enhancement adapts while maintaining protection LIP. finally Dynamic (DIP) choose between BIP traditional depending on incurs fewer misses. proposed policies do not require change existing structure, are trivial implement, storage requirement less two bytes. DIP reduces average MPKI baseline 1MB 16-way L2 by 21%, bridging two-thirds gap OPT.