Cache replacement based on reuse-distance prediction

Κεραμίδας, Γεώργιος; Petoumenos, Pavlos; Kaxiras, Stefanos

doi:10.1109/iccd.2007.4601909

Cited by 106 publications

(60 citation statements)

References 11 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Keramidas et al [9] proposed a cache replacement policy that uses reuse distance prediction. This policy tries to evict cache blocks that will be reused furthest in the future.…”

Section: Cache Placement and Replacement Policymentioning

confidence: 99%

Using dead blocks as a virtual victim cache

Khan

Burger

Jiménez

et al. 2010

Proceedings of the 19th International Conference on Parallel Architectures and Compilation Techniques

View full text Add to dashboard Cite

show abstract

“…Keramidas et al [9] proposed a cache replacement policy that uses reuse distance prediction. This policy tries to evict cache blocks that will be reused furthest in the future.…”

Section: Cache Placement and Replacement Policymentioning

confidence: 99%

Using dead blocks as a virtual victim cache

Khan

Burger

Jiménez

et al. 2010

Proceedings of the 19th International Conference on Parallel Architectures and Compilation Techniques

View full text Add to dashboard Cite

show abstract

“…The IPVs are chosen using an off-line genetic approach, and then selected between with set-dueling. Other approaches that modify insertion policy include Qureshi et al [27] and Keramidas et al [20].…”

Section: Related Workmentioning

confidence: 99%

Probabilistic Directed Writebacks for Exclusive Caches

Olson

Hill

2016

SIGARCH Comput. Archit. News

View full text Add to dashboard Cite

show abstract

“…Pseudo-LIFO [4] prioritizes to evict blocks on the top of fill stack to keep blocks in the bottom longer. A recent proposal guides replacement by explicitly predicting the reuse distance with a PC based predictor [17].…”

Section: Related Workmentioning

confidence: 99%

“…For a 1024-entry BDCT, the lower 10 bits of PC are used to index the BDCT. Like all PC based methods [17,19,20,21,23,35,37], the shortened PC is delivered along with the request through the cache hierarchies.…”

Section: Implementation Detailsmentioning

confidence: 99%

Optimal bypass monitor for high performance last-level caches

Tong

Xie

et al. 2012

Proceedings of the 21st International Conference on Parallel Architectures and Compilation Techniques

View full text Add to dashboard Cite

In the last-level cache, large amounts of blocks have reuse distances greater than the available cache capacity. Cache performance and efficiency can be improved if some subset of these distant reuse blocks can reside in the cache longer. The bypass technique is an effective and attractive solution that prevents the insertion of harmful blocks.Our analysis shows that bypass can contribute significant performance improvement, and the optimal bypass can achieve similar performance compared to OPT+B, which is the theoretical optimal replacement policy. Thus, we propose a bypass technique called Optimal Bypass Monitor (OBM), which makes bypass decisions by learning and predicting the behavior of the optimal bypass. OBM keeps a short global track of the incoming-victim block pairs. By detecting the first reuse block in each pair, the behavior of the optimal bypass on the track can be asserted to guide the bypass choice.Any existing replacement policy can be extended with OBM while requiring negligible design modification. Our experimental results show that using less than 1.5KB extra memory, OBM with the NRU replacement policy outperforms LRU by 9.7% and 8.9% for single-thread and multiprogrammed workloads respectively. Compared with other state-of-the-art proposals such as DRRIP and SDBP, it achieves superior performance with less storage overhead.

show abstract

Cache replacement based on reuse-distance prediction

Cited by 106 publications

References 11 publications

Using dead blocks as a virtual victim cache

Using dead blocks as a virtual victim cache

Probabilistic Directed Writebacks for Exclusive Caches

Optimal bypass monitor for high performance last-level caches

Contact Info

Product

Resources

About