Equitable revisited

Authors:
Wolfgang Bein;Lawrence L. Larmore;John Noga
Affiliations:
Center for the Advanced Study of Algorithms, School of Computer Science, University of Nevada Las Vegas, Nevada;Center for the Advanced Study of Algorithms, School of Computer Science, University of Nevada Las Vegas, Nevada;Computer Science Department, California State University, Northridge, CA
Venue:
ESA'07 Proceedings of the 15th annual European conference on Algorithms
Year:
2007

Citing 9
Cited 5

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
Trackless online algorithms for the server problem

Information Processing Letters - Special issue analytical theory of fuzzy control with applications
Limited bookmark randomized online algorithms for the paging problem

Information Processing Letters
Beyond Competitive Analysis

SIAM Journal on Computing
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

SIGACT news online algorithms column 13: 2007 - an offine perspective

ACM SIGACT News
Randomized Competitive Analysis for Two-Server Problems

ESA '08 Proceedings of the 16th annual European symposium on Algorithms
A randomized algorithm for two servers in cross polytope spaces

WAOA'07 Proceedings of the 5th international conference on Approximation and online algorithms
A randomized algorithm for two servers in cross polytope spaces

Theoretical Computer Science
Improved space bounds for strongly competitive randomized paging algorithms

ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part I

Quantified Score

Hi-index	0.00

Visualization

Abstract

The randomized k-paging algorithm EQUITABLE given by Achlioptas et al. is Hk-competitive and uses O(k2 log k) memory. This competitive ratio is best possible. The randomized algorithm RMARK given by Fiat et al. is (2Hk - 1)-competitive, but only uses O(k) memory. Borodin and El Yaniv [6] list as an open question whether there exists an Hk-competitive randomized algorithm which requires O(k) memory for k-paging. In this paper we answer this question in the affirmative by giving a modification of EQUITABLE.