Skip to main content
SpringerLink
Log in

Online Paging and Caching

1985–2002; multiple authors

  • Reference work entry
Encyclopedia of Algorithms

Keywords and Synonyms

Paging; Caching; Weighted caching; Weighted paging ; File caching                                              

Problem Definition

A file-caching problem instance specifies a cache size k (a positive integer) and a sequence of requests to files, each with a size (a positive integer) and a retrieval cost (a non-negative number). The goal is to maintain the cache to satisfy the requests while minimizing the retrieval cost. Specifically, for each request, if the file is not in the cache, one must retrieve it into the cache (paying the retrieval cost) and remove other files to bring the total size of files in the cache to k or less. Weighted caching, or weighted paging is the special case when each file size is 1. Paging is the special case when each file size and each retrieval cost is 1. Then the goal is to minimize cache misses, or equivalently the fault rate.

An algorithm is onlineif its response to each request is independent of later requests. In practice this is generally necessary. Standard worst-case...

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 399.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Recommended Reading

  1. Bansal, N., Buchbinder, N., Naor, J.: A primal-dual randomized algorithm for weighted paging. Proceedings of 48th Annual IEEE Symposium on Foundations of Computer Science, pp. 507–517 (2007)

    Google Scholar 

  2. Borodin, A., El-Yaniv, R.: Online computation and competitive analysis. Cambridge University Press, New York (1998)

    MATH  Google Scholar 

  3. Borodin, A., Irani, S., Raghavan, P., Schieber B.: Competitive paging with locality of reference. J. Comput. Syst. Sci. 50(2), 244–258 (1995)

    Article  MathSciNet  MATH  Google Scholar 

  4. Cao, P., Irani, S.: Cost-aware WWW proxy caching algorithms. In: USENIX Symposium on Internet Technologies and Systems, Monterey, December 1997

    Google Scholar 

  5. Chrobak, M., Karloff, H., Payne, T.H., Vishwanathan, S.: New results on server problems. SIAM J. Discret. Math. 4(2), 172–181 (1991)

    Article  MathSciNet  MATH  Google Scholar 

  6. Dilley, J., Arlitt, M., Perret, S.: Enhancement and validation of Squid's cache replacement policy. Hewlett‐Packard Laboratories Technical Report HPL-1999–69 (1999)

    Google Scholar 

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

    Article  MATH  Google Scholar 

  8. Irani, S.: Page replacement with multi-size pages and applications to Web caching. Algorithmica 33(3), 384–409 (2002)

    Article  MathSciNet  MATH  Google Scholar 

  9. Irani, S., Karlin, A.R., Phillips, S.: Strongly competitive algorithms for paging with locality of reference. SIAM J. Comput. 25(3), 477–497 (1996)

    Article  MathSciNet  MATH  Google Scholar 

  10. Karlin, A.R., Phillips, S.J., Raghavan, P.: Markov paging. SIAM J. Comput. 30(3), 906–922 (2000)

    Article  MathSciNet  MATH  Google Scholar 

  11. Koutsoupias, E., Papadimitriou, C.H.: Beyond competitive analysis. SIAM J. Comput. 30(1), 300–317 (2000)

    Article  MathSciNet  MATH  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

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

    Article  MathSciNet  Google Scholar 

  14. Young, N.E.: The k-server dual and loose competitiveness for paging. Algorithmica 11(6), 525–541 (1994)

    Article  MathSciNet  Google Scholar 

  15. Young, N.E.: On-line file caching. Algorithmica 33(3), 371–383 (2002)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of California at Riverside, Riverside, CA, USA

    Neal E. Young

Authors
  1. Neal E. Young
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Electrical Engineering and Computer ScienceMcCormick School of Engineering and Applied Science, Northwestern University, Evanston, IL, 60208, USA

    Ming-Yang Kao Professor of Computer Science

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag

About this entry

Cite this entry

Young, N. (2008). Online Paging and Caching. In: Kao, MY. (eds) Encyclopedia of Algorithms. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-30162-4_267

Download citation

Publish with us

Policies and ethics

Search

Navigation