Amortized efficiency of list update and paging rules
Communications of the ACM
New results on server problems
SIAM Journal on Discrete Mathematics
Journal of Algorithms
On-line caching as cache size varies
SODA '91 Proceedings of the second annual ACM-SIAM symposium on Discrete algorithms
Page replacement with multi-size pages and applications to Web caching
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Online computation and competitive analysis
Online computation and competitive analysis
Page replacement for general caching problems
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
LP-based analysis of greedy-dual-size
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Competitive analysis of randomized paging algorithms
Theoretical Computer Science
Strengthening integrality gaps for capacitated network design and covering problems
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
A unified approach to approximating resource allocation and scheduling
Journal of the ACM (JACM)
Competitive Analysis of Paging
Developments from a June 1996 seminar on Online algorithms: the state of the art
On the Equivalence between the Primal-Dual Schema and the Local Ratio Technique
SIAM Journal on Discrete Mathematics
Cost-aware WWW proxy caching algorithms
USITS'97 Proceedings of the USENIX Symposium on Internet Technologies and Systems on USENIX Symposium on Internet Technologies and Systems
A Primal-Dual Randomized Algorithm for Weighted Paging
FOCS '07 Proceedings of the 48th Annual IEEE Symposium on Foundations of Computer Science
Online Primal-Dual Algorithms for Covering and Packing
Mathematics of Operations Research
Caching is hard: even in the fault model
ESA'10 Proceedings of the 18th annual European conference on Algorithms: Part I
An O(log k)-competitive algorithm for generalized caching
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
On column-restricted and priority covering integer programs
IPCO'10 Proceedings of the 14th international conference on Integer Programming and Combinatorial Optimization
| Hi-index | 0.00 |
We consider online algorithms for the generalized caching problem. Here we are given a cache of size $k$ and pages with arbitrary sizes and fetching costs. Given a request sequence of pages, the goal is to minimize the total cost of fetching the pages into the cache. Our main result is an online algorithm with competitive ratio $O(\log^2k)$, which gives the first $o(k)$ competitive algorithm for the problem. We also give improved $O(\log k)$-competitive algorithms for the special cases of the bit model and fault model, improving upon the previous $O(\log^2k)$ guarantees due to Irani [Proceedings of the 29th Annual ACM Symposium on Theory of Computing, 1997, pp. 701-710]. Our algorithms are based on an extension of the online primal-dual framework introduced by Buchbinder and Naor [Math. Oper. Res., 34 (2009), pp. 270-286] and involve two steps. First, we obtain an $O(\log k)$-competitive fractional algorithm based on solving online an LP formulation strengthened with exponentially many knapsack cover constraints. Second, we design a suitable online rounding procedure to convert this online fractional algorithm into a randomized algorithm. Our techniques provide a unified framework for caching algorithms and are substantially simpler than those previously used.