On adaptive replacement based on LRU with working area restriction algorithm

Authors:
Edson T. Midorikawa;Ricardo L. Piantola;Hugo H. Cassettari
Affiliations:
University of São Paulo, São Paulo -- SP -- Brazil;University of São Paulo, São Paulo -- SP -- Brazil;University of São Paulo, São Paulo -- SP -- Brazil
Venue:
ACM SIGOPS Operating Systems Review
Year:
2008

Citing 16
Cited 0

Trace-driven memory simulation: a survey

ACM Computing Surveys (CSUR)
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
EELRU: simple and effective adaptive page replacement

SIGMETRICS '99 Proceedings of the 1999 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Sequentiality and prefetching in database systems

ACM Transactions on Database Systems (TODS)
Towards application/file-level characterization of block references: a case for fine-grained buffer management

Proceedings of the 2000 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
The working set model for program behavior

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
2Q: A Low Overhead High Performance Buffer Management Replacement Algorithm

VLDB '94 Proceedings of the 20th International Conference on Very Large Data Bases
General adaptive replacement policies

Proceedings of the 4th international symposium on Memory management
ARC: A Self-Tuning, Low Overhead Replacement Cache

FAST '03 Proceedings of the 2nd USENIX Conference on File and Storage Technologies
CAR: Clock with Adaptive Replacement

FAST '04 Proceedings of the 3rd USENIX Conference on File and Storage Technologies
CLOCK-Pro: an effective improvement of the CLOCK replacement

ATEC '05 Proceedings of the annual conference on USENIX Annual Technical Conference
A low-overhead high-performance unified buffer management scheme that exploits sequential and looping references

OSDI'00 Proceedings of the 4th conference on Symposium on Operating System Design & Implementation - Volume 4
An implementation study of a detection-based adaptive block replacement scheme

ATEC '99 Proceedings of the annual conference on USENIX Annual Technical Conference
Operating System Concepts

Operating System Concepts

Quantified Score

Hi-index	0.00

Visualization

Abstract

Adaptive algorithms are capable of modifying their own behavior through time, depending on the execution characteristics. Recently, we have proposed LRU-WAR, an adaptive replacement algorithm whose objective is to minimize failures detected in LRU policy, preserving its simplicity and low overhead. In this paper, we present our contribution to the study of adaptive replacement algorithms describing their behavior under a number of workloads. Simulations include an analysis of the performance sensibility with the variation of the control parameters and its application in a multiprogrammed environment. In order to address LRU-WAR weakness as a global policy, we also introduce LRU-WARlock. The simulation results show that substantial performance improvements can be obtained.