Skip to main content
SpringerLink
Log in
Book cover

Encyclopedia of Algorithms pp 1457–1461Cite as

Online Paging and Caching

  • Reference work entry
  • First Online:

  • 135 Accesses

Years and Authors of Summarized Original Work

  • 1985–2013; multiple authors

Synonyms

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

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 nonnegative 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 retrieval cost is the number of cache misses, and the fault rate is the average retrieval cost per request).

An algorithm is onlineif its response to each...

This is a preview of subscription content, 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   1,599.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Hardcover Book
USD   1,999.99
Price excludes VAT (USA)
  • Durable hardcover 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

Learn about institutional subscriptions

Recommended Reading

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

    Google Scholar 

  2. Buchbinder N, Naor J (2009) Online primal-dual algorithms for covering and packing. Math Oper Res 34(2):270–286. INFORMS

    Google Scholar 

  3. Cao P, Irani S (1997) Cost-aware WWW proxy caching algorithms. In: USENIX symposium on internet technologies and systems, Monterey, vol 12(97), pp 193–206

    Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  5. Dilley J, Arlitt M, Perret S (1999) Enhancement and validation of Squid’s cache replacement policy. Technical report HPL-1999-69, Hewlett-Packard Laboratories, also in 4th International Web Caching Workshop

    Google Scholar 

  6. Fiat A, Karp RM, Luby M, McGeoch LA, Sleator DD, Young NE (1991) Competitive paging algorithms. J Algorithms 12:685–699

    Article  MATH  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

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

    Google Scholar 

  9. Karlin AR, Phillips SJ, Raghavan P (2000) Markov paging. SIAM J Comput 30(3):906–922

    Article  MathSciNet  MATH  Google Scholar 

  10. Koufogiannakis C, Young NE (2013) Greedy Δ-approximation algorithm for covering with arbitrary constraints and submodular cost. Algorithmica 66(1):113–152

    Article  MathSciNet  MATH  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

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

    Article  MathSciNet  Google Scholar 

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

    Article  MathSciNet  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science and Engineering, University of California, 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

Corresponding author

Correspondence to Neal E. Young .

Editor information

Editors and Affiliations

  1. Department of Electrical Engineering and Computer Science, Northwestern University, Evanston, IL, USA

    Ming-Yang Kao

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer Science+Business Media New York

About this entry

Cite this entry

Young, N.E. (2016). Online Paging and Caching. In: Kao, MY. (eds) Encyclopedia of Algorithms. Springer, New York, NY. https://doi.org/10.1007/978-1-4939-2864-4_267

Download citation

Publish with us

Policies and ethics

Search

Navigation