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 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.
Unable to display preview. Download preview PDF.
- 5.Frigo, M., Leiserson, C.E., Prokop, H., Ramachandran, S.:Cache-oblivious algorithms. In: 40th Annual Symposium on Foundations of Computer Science, pp. 285–297, New York, October 17–19 (1999)Google Scholar
- 7.Irani, S.: Competitive analysis of paging. In: Fiat, A. (ed.) Developments from a June 1996 Seminar on Online Algorithms. LNCS, vol. 1442, pp. 52–73. Springer, Heidelberg (1998)Google Scholar
- 9.Sandeep Sen and Siddhartha Chatterjee. Towards a theory of cache-efficient algorithms. In: Proceedings of the 11th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 829–838, San Francisco, California (January 2000)Google Scholar