Skip to main content
SpringerLink
Log in

The Worst Page-Replacement Policy

  • Conference paper
Fun with Algorithms (FUN 2007)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 4475))

Included in the following conference series:

Abstract

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.

This research was supported in part by NSF grants CCF 0621439/0621425, CCF 0540897/05414009, CCF 0634793/0632838, CCF 0541209, and CNS 0627645, and by Google Inc.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Achlioptas, D., Chrobak, M., Noga, J.: Competitive analysis of randomized paging algorithms. In: Díaz, J. (ed.) ESA 1996. LNCS, vol. 1136, pp. 419–430. Springer, Heidelberg (1996)

    Chapter  Google Scholar 

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

    Article  Google Scholar 

  3. Borodin, A., Irani, S., Raghavan, P., Schieber, B.: Competitive paging with locality of reference. Journal of Computer and System Sciences 50(2), 244–258 (1995)

    Article  MathSciNet  MATH  Google Scholar 

  4. Fiat, A., Karp, R.M., Luby, M., McGeoch, L.A., Sleator, D.D., Young, N.E.: Competitive paging algorithms. Journal of Algorithms 12(4), 685–699 (1991)

    Article  MATH  Google Scholar 

  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 

  6. Hennessy, J.L., Patterson, D.A.: Computer Architecture: a Quantitative Approach, 3rd edn. Morgan Kaufmann, San Francisco, CA (2003)

    MATH  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 

  8. McGeoch, L.A., Sleator, D.D.: A strongly competitive randomized paging algorithm. Algorithmica 6, 816–825 (1991)

    Article  MathSciNet  MATH  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 

  10. Sleator, D.D., Tarjan, R.E.: Amortized efficiency of list update and paging rules. Communications of the ACM 28(2), 202–208 (1985)

    Article  MathSciNet  Google Scholar 

  11. Vitter, J.S.: Random sampling with a reservoir. ACM Transactions on Mathematical Software 11(1), 37–57 (1985)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. MIT, Cambridge, MA 02139, USA

    Kunal Agrawal & Jeremy T. Fineman

  2. Stony Brook University, Stony Brook, NY 11794-4400, USA

    Michael A. Bender

Authors
  1. Kunal Agrawal
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Michael A. Bender
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Jeremy T. Fineman
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Dipartimento di Sistemi e Informatica, Università degli Studi di Firenze, Viale Morgagni 65, 50134, Firenze, Italy

    Pierluigi Crescenzi

  2. Dipartimento di Informatica, Università degli Studi di Pisa, Largo Bruno Pontecorvo 3, 56127, Pisa, Italy

    Giuseppe Prencipe

  3. Dipartimento di Ingegneria dell’Informazione, Università degli Studi di Padova, Via Gradenigo 6/B, 35131, Padova, Italy

    Geppino Pucci

Rights and permissions

Reprints and permissions

Copyright information

© 2007 Springer Berlin Heidelberg

About this paper

Cite this paper

Agrawal, K., Bender, M.A., Fineman, J.T. (2007). The Worst Page-Replacement Policy. In: Crescenzi, P., Prencipe, G., Pucci, G. (eds) Fun with Algorithms. FUN 2007. Lecture Notes in Computer Science, vol 4475. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-72914-3_13

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-72914-3_13

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-72913-6

  • Online ISBN: 978-3-540-72914-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation