The harmonic k-server algorithm is competitive

Yair Bartal, Eddie Grove*

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

38 Scopus citations

Abstract

The k-server problem is a generalization of the paging problem, and is the most studied problem in the area of competitive online problems. The Harmonic algorithm is a very natural and simple randomized algorithm for the k-server problem. We give a simple proof that the Harmonic k-server algorithm is competitive. The competitive ratio we prove is the best currently known for the algorithm. The Harmonic algorithm is memoryless and time-efficient. This is the only such algorithm known to be competitive for the k-server problem. General Terms: Algorithms, Performance, Theory, Verification

Original languageAmerican English
Pages (from-to)1-15
Number of pages15
JournalJournal of the ACM
Volume47
Issue number1
DOIs
StatePublished - 2000
Externally publishedYes

Fingerprint

Dive into the research topics of 'The harmonic k-server algorithm is competitive'. Together they form a unique fingerprint.

Cite this