The Worst Page-Replacement Policy

In this paper, we consider the question: what is the worst possible 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 pagereplacement 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.

• Type: Conference
• Year: 2007
• Where: FUN
• Authors: Kunal Agrawal, Michael A. Bender, Jeremy T. Fineman
• Keywords: Algorithms, FUN 2007, Page-replacement Strategy, Possible Page-replacement Strategy, Worst Offline Strategy