Amortized efficiency of list update and paging rules
Communications of the ACM
Journal of Algorithms
Online computation and competitive analysis
Online computation and competitive analysis
Competitive analysis of randomized paging algorithms
Theoretical Computer Science
Limited bookmark randomized online algorithms for the paging problem
Information Processing Letters
More on randomized on-line algorithms for caching
Theoretical Computer Science
Beyond competitive analysis [on-line algorithms]
SFCS '94 Proceedings of the 35th Annual Symposium on Foundations of Computer Science
A study of replacement algorithms for a virtual-storage computer
IBM Systems Journal
ESA'07 Proceedings of the 15th annual European conference on Algorithms
Algorithmica - Special issue: Algorithms, Combinatorics, & Geometry
Outperforming LRU via competitive analysis on parametrized inputs for paging
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
| Hi-index | 0.00 |
Paging is a prominent problem in the field of online algorithms. While in the deterministic setting there exist simple and efficient strongly competitive algorithms, in the randomized setting a tradeoff between competitiveness and memory is still not settled. In this paper we address the conjecture in [2], that there exist strongly competitive randomized paging algorithms using o(k) bookmarks, i.e. pages not in cache that the algorithm keeps track of. We prove tighter bounds for Equitable2 [2], showing that it requires less than k bookmarks, more precisely ≈0.62 k. We then give a lower bound for Equitable2 showing that it cannot both be strongly competitive and use o(k) bookmarks. Our main result proves the conjecture that there exist strongly competitive paging algorithms using o(k) bookmarks. We propose an algorithm, denoted Partition2, which is a variant of the Partition algorithm in [3]. While Partition is unbounded in its space requirements, Partition2 uses Θ(k/logk) bookmarks.