Considering the frequency dimension into on demand adaptive algorithms

Authors:
Jacinto C.A. Cansado;João H.S. Pereira;Edson T. Midorikawa
Affiliations:
University of São Paulo, São Paulo, Brazil;University of São Paulo, São Paulo, Brazil;University of São Paulo, São Paulo, Brazil
Venue:
ACM SIGOPS Operating Systems Review
Year:
2010

Citing 10
Cited 0

Data cache management using frequency-based replacement

SIGMETRICS '90 Proceedings of the 1990 ACM SIGMETRICS conference on Measurement and modeling of computer systems
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
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
ARC: A Self-Tuning, Low Overhead Replacement Cache

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

Operating Systems Concepts
A study of replacement algorithms for a virtual-storage computer

IBM Systems Journal

Quantified Score

Hi-index	0.00

Visualization

Abstract

Efficient memory usage in high performance timesharing computing systems is a considerable challenge. Some research areas on adaptive algorithms concerning memory page replacement, analyze the memory access behavior seeking to store the pages that will be used in a near future and discarding the others. This is important due to the high cost of treating page faults. The proposal is to analyze the influence of page access frequency on adaptive algorithms, using its structure and applying page replacement with access frequency analysis, as a function of its execution state. The comparative performance analysis is conducted by using trace files that represent different memory access behaviors.