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 language | English |
|---|---|
| Pages (from-to) | 1-15 |
| Number of pages | 15 |
| Journal | Journal of the ACM |
| Volume | 47 |
| Issue number | 1 |
| DOIs | |
| State | Published - 2000 |
| Externally published | Yes |