ONLINEMIN: a fast strongly competitive randomized paging algorithm

Authors:
Gerth Stølting Brodal;Gabriel Moruz;Andrei Negoescu
Affiliations:
MADALGO, Department of Computer Science, Aarhus University, Aarhus N, Denmark;Goethe University Frankfurt am Main, Frankfurt am Main, Germany;Goethe University Frankfurt am Main, Frankfurt am Main, Germany
Venue:
WAOA'11 Proceedings of the 9th international conference on Approximation and Online Algorithms
Year:
2011

Citing 8
Cited 2

Amortized efficiency of list update and paging rules

Communications of the ACM
Competitive paging algorithms

Journal of Algorithms
Online computation and competitive analysis

Online computation and competitive analysis
Competitive analysis of randomized paging algorithms

Theoretical Computer Science
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
Knowledge State 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
Engineering efficient paging algorithms

SEA'12 Proceedings of the 11th international conference on Experimental Algorithms

Quantified Score

Hi-index	0.00

Visualization

Abstract

In the field of online algorithms paging is one of the most studied problems. For randomized paging algorithms a tight bound of Hk on the competitive ratio has been known for decades, yet existing algorithms matching this bound have high running times. We present the first randomized paging approach that both has optimal competitiveness and selects victim pages in subquadratic time. In fact, if k pages fit in internal memory the best previous solution required O(k2) time per request and O(k) space, whereas our approach takes also O(k) space, but only O(logk) time in the worst case per page request.