The worst page-replacement policy

Authors:
Kunal Agrawal;Michael A. Bender;Jeremy T. Fineman
Affiliations:
MIT, Cambridge, MA;Stony Brook University, Stony Brook, NY;MIT, Cambridge, MA
Venue:
FUN'07 Proceedings of the 4th international conference on Fun with algorithms
Year:
2007

Citing 10
Cited 0

Amortized efficiency of list update and paging rules

Communications of the ACM
Random sampling with a reservoir

ACM Transactions on Mathematical Software (TOMS)
Competitive paging algorithms

Journal of Algorithms
Competitive paging with locality of reference

Selected papers of the 23rd annual ACM symposium on Theory of computing
Towards a theory of cache-efficient algorithms

SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Competitive Analysis of Paging

Developments from a June 1996 seminar on Online algorithms: the state of the art
Competive Analysis of Randomized Paging Algorithms

ESA '96 Proceedings of the Fourth Annual European Symposium on Algorithms
Cache-Oblivious Algorithms

FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Computer Architecture: A Quantitative Approach

Computer Architecture: A Quantitative Approach
A study of replacement algorithms for a virtual-storage computer

IBM Systems Journal

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we consider the question: what is the worstossible page-replacement strategy? Our goal is to devise an online strategy that has the highest possible fraction of misses as compared to the worst offline strategy. We show that there is no deterministic, online page-replacement strategy that is competitive with the worst offline strategy. We give a randomized strategy based on the "most-recently-used" heuristic, and show that this is the worst possible online page-replacement strategy.