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
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
A unified approach to approximating resource allocation and scheduling
Journal of the ACM (JACM)
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
Randomized competitive algorithms for generalized caching
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Online primal-dual algorithms for covering and packing problems
ESA'05 Proceedings of the 13th annual European conference on Algorithms
Optimal online buffer scheduling for block devices
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
A Primal-Dual Randomized Algorithm for Weighted Paging
Journal of the ACM (JACM)
Randomized Competitive Algorithms for Generalized Caching
SIAM Journal on Computing
Energy efficient caching for phase-change memory
MedAlg'12 Proceedings of the First Mediterranean conference on Design and Analysis of Algorithms
Hi-index | 0.00 |
In the generalized caching problem, we have a set of pages and a cache of size k. Each page p has a size wp ≥ 1 and fetching cost cp for loading the page into the cache. At any point in time, the sum of the sizes of the pages stored in the cache cannot exceed k. The input consists of a sequence of page requests. If a page is not present in the cache at the time it is requested, it has to be loaded into the cache incurring a cost of cp. We give a randomized O(log k)-competitive online algorithm for the generalized caching problem, improving the previous bound of O(log2 k) by Bansal, Buchbinder, and Naor (STOC'08). This improved bound is asymptotically tight and of the same order as the known bounds for the classic problem with uniform weights and sizes. We follow the LP based techniques proposed Bansal et al. and our main contribution are improved and slightly simplified methods for rounding fractional solutions online.