A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2007; you can also visit the original URL.
The file type is application/pdf
.
Performance evaluation of cache replacement policies for the SPEC CPU2000 benchmark suite
2004
Proceedings of the 42nd annual Southeast regional conference on - ACM-SE 42
Replacement policy, one of the key factors determining the effectiveness of a cache, becomes even more important with latest technological trends toward highly associative caches. The state-of-the-art processors employ various policies such as Random, Least Recently Used (LRU), Round-Robin, and PLRU (Pseudo LRU), indicating that there is no common wisdom about the best one. Optimal yet unattainable policy would replace cache memory block whose next reference is the farthest away in the future,
doi:10.1145/986537.986601
dblp:conf/ACMse/Al-ZoubiMM04
fatcat:yy3nxllshzao7hpvbcmlol6cua