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...
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Recommended Reading
Borodin A, Irani S, Raghavan P, Schieber B (1995) Competitive paging with locality of reference. J Comput Syst Sci 50(2):244–258. Elsevier
Buchbinder N, Naor J (2009) Online primal-dual algorithms for covering and packing. Math Oper Res 34(2):270–286. INFORMS
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
Chrobak M, Karloff H, Payne T, Vishwanathan S (1991) New results on server problems. SIAM J Discret Math 4(2):172–181
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
Fiat A, Karp RM, Luby M, McGeoch LA, Sleator DD, Young NE (1991) Competitive paging algorithms. J Algorithms 12:685–699
Irani S (2002) Page replacement with multi-size pages and applications to web caching. Algorithmica 33(3):384–409
Irani S, Karlin AR, Phillips S (1996) Strongly competitive algorithms for paging with locality of reference. SIAM J Comput 25(3):477–497. SIAM
Karlin AR, Phillips SJ, Raghavan P (2000) Markov paging. SIAM J Comput 30(3):906–922
Koufogiannakis C, Young NE (2013) Greedy Δ-approximation algorithm for covering with arbitrary constraints and submodular cost. Algorithmica 66(1):113–152
Koutsoupias E, Papadimitriou C (2000) Beyond competitive analysis. SIAM J Comput 30(1):300–317
McGeoch L, Sleator D (1991) A strongly competitive randomized paging algorithm. Algorithmica 6(6):816–825
Sleator D, Tarjan RE (1985) Amortized efficiency of list update and paging rules. Commun ACM 28:202–208
Young NE (1994) The k-server dual and loose competitiveness for paging. Algorithmica 11:525–541
Young NE (2002) On-line file caching. Algorithmica 33(3):371–383
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights 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
DOI: https://doi.org/10.1007/978-1-4939-2864-4_267
Published:
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4939-2863-7
Online ISBN: 978-1-4939-2864-4
eBook Packages: Computer ScienceReference Module Computer Science and Engineering