General adaptive replacement policies

Authors:
Yannis Smaragdakis
Affiliations:
Georgia Institute of Technology, GA
Venue:
Proceedings of the 4th international symposium on Memory management
Year:
2004

Citing 15
Cited 4

Amortized efficiency of list update and paging rules

Communications of the ACM
Data cache management using frequency-based replacement

SIGMETRICS '90 Proceedings of the 1990 ACM SIGMETRICS conference on Measurement and modeling of computer systems
Adaptive page replacement based on memory reference behavior

SIGMETRICS '97 Proceedings of the 1997 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Execution characteristics of desktop applications on Windows NT

Proceedings of the 25th annual international symposium on Computer architecture
Trace reduction for virtual memory simulations

SIGMETRICS '99 Proceedings of the 1999 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
EELRU: simple and effective adaptive page replacement

SIGMETRICS '99 Proceedings of the 1999 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
On the existence of a spectrum of policies that subsumes the least recently used (LRU) and least frequently used (LFU) policies

SIGMETRICS '99 Proceedings of the 1999 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Principles of Optimal Page Replacement

Journal of the ACM (JACM)
Computation of page fault probability from program transition diagram

Communications of the ACM
LIRS: an efficient low inter-reference recency set replacement policy to improve buffer cache performance

SIGMETRICS '02 Proceedings of the 2002 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
LRFU: A Spectrum of Policies that Subsumes the Least Recently Used and Least Frequently Used Policies

IEEE Transactions on Computers
Design, Implementation, and Performance Evaluation of a Detection-Based Adaptive Block Replacement Scheme

IEEE Transactions on Computers
Segmented FIFO page replacement

SIGMETRICS '81 Proceedings of the 1981 ACM SIGMETRICS conference on Measurement and modeling of computer systems
The EELRU adaptive replacement algorithm

Performance Evaluation
ARC: A Self-Tuning, Low Overhead Replacement Cache

FAST '03 Proceedings of the 2nd USENIX Conference on File and Storage Technologies

Adaptive Caches: Effective Shaping of Cache Behavior to Workloads

Proceedings of the 39th Annual IEEE/ACM International Symposium on Microarchitecture
On adaptive replacement based on LRU with working area restriction algorithm

ACM SIGOPS Operating Systems Review
Teaching page replacement algorithms with a Java-based VM simulator

Proceedings of the 14th Western Canadian Conference on Computing Education
Least likely to use: a new page replacement strategy for improving database management system response time

CSR'06 Proceedings of the First international computer science conference on Theory and Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

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 MRU-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.