Abstract
Thepaging problem is that of deciding which pages to keep in a memory ofk pages in order to minimize the number of page faults. We develop thepartitioning algorithm, a randomized on-line algorithm for the paging problem. We prove that its expected cost on any sequence of requests is within a factor ofH k of optimum. (H k is thekth harmonic number, which is about ln(k).) No on-line algorithm can perform better by this measure. Our result improves by a factor of two the best previous algorithm.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Belady, L. A. A study of replacement algorithms for virtual storage computers.IBM Systems Journal,5:78–101, 1966.
Fiat, A., Karp, R. M., Luby, M., McGeoch, L. A., Sleator, D. D., and Young, N. E. Competitive paging algorithms.Journal of Algorithms, to appear, 1991.
Manasse, M. S., McGeoch, L. A., and Sleator, D. D. Competitive algorithms for on-line problems. InProceedings of the 20th Annual ACM Symposium on Theory of Computing, Chicago, 1988, pages 322–333.
Manasse, M. S., McGeoch, L. A., and Sleator, D. D. Competitive algorithms for server problems.Journal of Algorithms, 11(2):208–230, June 1990.
Sleator, D. D., and Tarjan, R. E. Amortized efficiency of list update and paging rules.Communications of the ACM, 28(2):202–208, February 1985.
Author information
Authors and Affiliations
Additional information
Communicated by C. K. Wong.
Partial support for D. D. Sleator was provided by DARPA, ARPA Order 4976, Amendment 20, monitored by the Air Force Avionics Laboratory under Contract F33615-87-C-1499, and by the National Science Foundation under Grant CCR-8658139.
Rights and permissions
About this article
Cite this article
McGeoch, L.A., Sleator, D.D. A strongly competitive randomized paging algorithm. Algorithmica 6, 816–825 (1991). https://doi.org/10.1007/BF01759073
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01759073