[go: up one dir, main page]
More Web Proxy on the site http://driver.im/ Skip to main content
Springer Nature Link
Log in

A strongly competitive randomized paging algorithm

  • Published:
Algorithmica Aims and scope Submit manuscript

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.

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
£29.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price includes VAT (United Kingdom)

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Belady, L. A. A study of replacement algorithms for virtual storage computers.IBM Systems Journal,5:78–101, 1966.

    Article  Google Scholar 

  2. 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.

  3. 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.

  4. Manasse, M. S., McGeoch, L. A., and Sleator, D. D. Competitive algorithms for server problems.Journal of Algorithms, 11(2):208–230, June 1990.

    Article  MATH  MathSciNet  Google Scholar 

  5. 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.

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics and Computer Science, Amherst College, 01002, Amherst, MA, USA

    Lyle A. McGeoch

  2. School of Computer Science, Carnegie Mellon University, 15213, Pittsburgh, PA, USA

    Daniel D. Sleator

Authors
  1. Lyle A. McGeoch
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Daniel D. Sleator
    View author publications

    You can also search for this author in PubMed Google Scholar

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

Reprints 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

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01759073

Key words

Search

Navigation