General adaptive replacement policies

Yannis Smaragdakis
2004 Proceedings of the 4th international symposium on Memory management - ISMM '04  
We propose a general scheme for creating adaptive replacement policies with good performance and strong theoretical guarantees. Specifically, we show how to combine any two existing replacement policies so that the resulting policy provably can never perform worse than either of the original policies by more than a small factor. To show that our scheme performs very well with real application data, we derive a virtual memory replacement policy that adapts between LRU, loop detection, LFU, and
more » ... U-like replacement. The resulting policy often performs better than all of the policies it adapts over, as well as two other hand-tuned adaptive policies from the recent literature.
doi:10.1145/1029873.1029887 dblp:conf/iwmm/Smaragdakis04 fatcat:7d47pmiky5eslcfl2khnptoffm