Encyclopedia of Algorithms

2016 Edition
| Editors: Ming-Yang Kao

Online Paging and Caching

  • Neal E. Young
Reference work entry
DOI: https://doi.org/10.1007/978-1-4939-2864-4_267

Years and Authors of Summarized Original Work

  • 1985–2013; multiple authors


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


Caching Competitive analysis Competitive ratio k-server problem Least-recently-used Online algorithms Paging 
This is a preview of subscription content, log in to check access.

Recommended Reading

  1. 1.
    Borodin A, Irani S, Raghavan P, Schieber B (1995) Competitive paging with locality of reference. J Comput Syst Sci 50(2):244–258. ElsevierGoogle Scholar
  2. 2.
    Buchbinder N, Naor J (2009) Online primal-dual algorithms for covering and packing. Math Oper Res 34(2):270–286. INFORMSGoogle Scholar
  3. 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–206Google Scholar
  4. 4.
    Chrobak M, Karloff H, Payne T, Vishwanathan S (1991) New results on server problems. SIAM J Discret Math 4(2):172–181MathSciNetMATHCrossRefGoogle Scholar
  5. 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 WorkshopGoogle Scholar
  6. 6.
    Fiat A, Karp RM, Luby M, McGeoch LA, Sleator DD, Young NE (1991) Competitive paging algorithms. J Algorithms 12:685–699MATHCrossRefGoogle Scholar
  7. 7.
    Irani S (2002) Page replacement with multi-size pages and applications to web caching. Algorithmica 33(3):384–409MathSciNetMATHCrossRefGoogle Scholar
  8. 8.
    Irani S, Karlin AR, Phillips S (1996) Strongly competitive algorithms for paging with locality of reference. SIAM J Comput 25(3):477–497. SIAMGoogle Scholar
  9. 9.
    Karlin AR, Phillips SJ, Raghavan P (2000) Markov paging. SIAM J Comput 30(3):906–922MathSciNetMATHCrossRefGoogle Scholar
  10. 10.
    Koufogiannakis C, Young NE (2013) Greedy Δ-approximation algorithm for covering with arbitrary constraints and submodular cost. Algorithmica 66(1):113–152MathSciNetMATHCrossRefGoogle Scholar
  11. 11.
    Koutsoupias E, Papadimitriou C (2000) Beyond competitive analysis. SIAM J Comput 30(1):300–317MathSciNetMATHCrossRefGoogle Scholar
  12. 12.
    McGeoch L, Sleator D (1991) A strongly competitive randomized paging algorithm. Algorithmica 6(6):816–825MathSciNetMATHCrossRefGoogle Scholar
  13. 13.
    Sleator D, Tarjan RE (1985) Amortized efficiency of list update and paging rules. Commun ACM 28:202–208MathSciNetCrossRefGoogle Scholar
  14. 14.
    Young NE (1994) The k-server dual and loose competitiveness for paging. Algorithmica 11:525–541MathSciNetCrossRefGoogle Scholar
  15. 15.
    Young NE (2002) On-line file caching. Algorithmica 33(3):371–383MathSciNetMATHCrossRefGoogle Scholar

Copyright information

© Springer Science+Business Media New York 2016

Authors and Affiliations

  1. 1.Department of Computer Science and Engineering, University of CaliforniaRiversideUSA