Download:
|
by Parikshit Gopalan, Howard Karloff, Aranyak Mehta, Milena Mihail, Nisheeth Vishnoi
Proc. 13th ACM-SIAM Symposium on Discrete Algorithms
http://www.cc.gatech.edu/~parik/RESEARCH/cache.ps
Add To MetaCart
Abstract:
Abstract. Caching data together with expiration times beyond which the data is no longer valid is a standard method for promoting information coherence in distributed systems, including the Internet and the WWW. We use the framework of competitive analysis of online algorithms, and study upper and lower bounds for page eviction strategies in the case where data has expiration times. We show that suitable adaptations of LRU and its ramifications (marking algorithms) are asymptotically optimal, and in the worst case within a multiplicative factor 2 of the lower bounds. Our results confirm the effectiveness of the apparent wide practice of LRU, even in this generalized scenario. A key technical ingredient of our analysis is a new "covering " invariant that appears to capture the subtleties introduced by expiration times. The additional difficulty of dealing with expiration times is also reflected in our analysis of the randomized online marking algorithm, as well as the offline version of the problem for which we obtain a factor 3 approximation.
Citations
|
3148
|
Computer architecture: a quantitative approach
– Hennessy, Patterson
- 1990
|
|
1258
|
Randomized Algorithms
– Motwani, Raghavan
- 1997
|
|
634
|
Amortized efficiency of list update and paging rules
– Sleator, Tarjan
- 1985
|
|
429
|
Online computation and competitive analysis
– Borodin, El-Yaniv
- 1998
|
|
401
|
Cost-aware WWW proxy caching algorithms
– Cao, Irani
- 1997
|
|
387
|
A study of replacement algorithms for virtual storage computers. IBMSystems Journal
– Belady
- 1966
|
|
157
|
Competitive paging algorithms
– Fiat, Karp, et al.
- 1991
|
|
60
|
replacement with multi-size pages and applications to Web caching
– Page
- 1997
|
|
58
|
Prefetching the means for document transfer: A new approach for reducing Web latency
– Cohen, Kaplan
- 2000
|
|
55
|
Caching in Large-Scale Distributed File Systems
– Blaze
- 1993
|
|
46
|
World wide web cache consistency
– Gwertzman, Seltzer
- 1996
|
|
40
|
Proactive caching of DNS records: Addressing a performance bottleneck
– Cohen, Kaplan
- 2001
|
|
40
|
Client Data Caching: A Foundation for High Performance Object Database System
– Franklin, Carey
- 1996
|
|
27
|
Refreshment policies for Web content caches
– Cohen, Kaplan
- 2001
|
|
20
|
Maintaining Strong Cache Consistency
– Cao, Liu
- 1997
|
|
18
|
Online computation. In Approximation Algorithms for NP-hard Problems
– IRANI, KARLIN
- 1997
|
|
10
|
The age penalty and its effect on cache performance
– Cohen, Kaplan
- 2001
|
|
9
|
Efficient implementation of data cubes via materialized views
– Ullman
- 1996
|
|
5
|
DynaMat: A Dynamic View
– Kotidis, Roussopoulos
- 1999
|
|
3
|
Intelligent Caching for WWW Objects
– Wessels
- 1995
|
