Amortized efficiency of list update and paging rules
Communications of the ACM
Competitive algorithms for server problems
Journal of Algorithms
An optimal on-line algorithm for K-servers on trees
SIAM Journal on Computing
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
An optimal on-line algorithm for metrical task system
Journal of the ACM (JACM)
Competitive k-server algorithms
Journal of Computer and System Sciences - Special issue: 31st IEEE conference on foundations of computer science, Oct. 22–24, 1990
Journal of the ACM (JACM)
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
A polylog(n)-competitive algorithm for metrical task systems
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Online computation and competitive analysis
Online computation and competitive analysis
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)
Better Algorithms for Unfair Metrical Task Systems and Applications
SIAM Journal on Computing
Proceedings of the eighteenth annual ACM symposium on Parallelism in algorithms and architectures
Randomized k-server on hierarchical binary trees
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Randomized competitive algorithms for generalized caching
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
The Design of Competitive Online Algorithms via a Primal: Dual Approach
Foundations and Trends® in Theoretical Computer Science
Online primal-dual algorithms for maximizing ad-auctions revenue
ESA'07 Proceedings of the 15th annual European conference on Algorithms
A Polylogarithmic-Competitive Algorithm for the k-Server Problem
FOCS '11 Proceedings of the 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science
An O(log k)-competitive algorithm for generalized caching
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Online primal-dual algorithms for covering and packing problems
ESA'05 Proceedings of the 13th annual European conference on Algorithms
| Hi-index | 0.00 |
We study the weighted version of the classic online paging problem where there is a weight (cost) for fetching each page into the cache. We design a randomized O(log k)-competitive online algorithm for this problem, where k is the cache size. This is the first randomized o(k)-competitive algorithm and its competitive ratio matches the known lower bound for the problem, up to constant factors. More generally, we design an O(log(k/(k − h + 1)))-competitive online algorithm for the version of the problem where the online algorithm has cache size k and it is compared to an optimal offline solution with cache size h ≤ k. Our solution is based on a two-step approach. We first obtain an O(log k)-competitive fractional algorithm based on an online primal-dual approach. Next, we obtain a randomized algorithm by rounding in an online manner the fractional solution to a probability distribution on the possible cache states. We also give an online primal-dual randomized O(log N)-competitive algorithm for the Metrical Task System problem (MTS) on a weighted star metric on N leaves.