Online Paging and Caching
Years and Authors of Summarized Original Work
1985–2013; multiple authors
Caching; File caching; Paging; Weighted caching; Weighted paging
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...
KeywordsCaching Competitive analysis Competitive ratio k-server problem Least-recently-used Online algorithms Paging
- 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.Buchbinder N, Naor J (2009) Online primal-dual algorithms for covering and packing. Math Oper Res 34(2):270–286. INFORMSGoogle 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–206Google 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 WorkshopGoogle 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. SIAMGoogle Scholar