The harmonic k -server algorithm is competitive-Reference-Cited by-同舟云学术

The harmonic k -server algorithm is competitive

Published:2000-01 Issue:1 Volume:47 Page:1-15
ISSN:0004-5411
Container-title:Journal of the ACM
language:en
Short-container-title:J. ACM

Author:

Bartal Yair¹,Grove Eddie²

Affiliation:

1. Tel-Aviv Univ., Tel-Aviv, Israel

2. Duke Univ., Durham, NC

Abstract

The k -server problem is a generalization of the paging problems, and is the most studied problem in the area of competive 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 fo 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.

Publisher

Association for Computing Machinery (ACM)

Subject

Artificial Intelligence,Hardware and Architecture,Information Systems,Control and Systems Engineering,Software

Link

https://dl.acm.org/doi/pdf/10.1145/331605.331606

Reference11 articles.

1. The Distributedk-Server Problem—A Competitive Distributed Translator fork-Server Algorithms

2. BEN-DAVID S. BORODIN A. KARP R. M. TARDOS G. AND WIGDERSON A. 1994. On the power of randomization in online algorithms. Algorithmica 11 (1) (Jan) 2-14. BEN-DAVID S. BORODIN A. KARP R. M. TARDOS G. AND WIGDERSON A. 1994. On the power of randomization in online algorithms. Algorithmica 11 (1) (Jan) 2-14.

3. New Ressults on Server Problems

4. HARMONIC is 3-competitive for two servers

Cited by 32 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Putting ridesharing to the test: efficient and scalable solutions and the power of dynamic vehicle relocation;Artificial Intelligence Review;2022-02-15

2. A Hitting Set Relaxation for $k$-Server and an Extension to Time-Windows;2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS);2022-02

3. Resource Inference for Sustainable and Responsive Task Offloading in Challenged Edge Networks;IEEE Transactions on Green Communications and Networking;2021-09

4. The Infinite Server Problem;ACM Transactions on Algorithms;2021-08

5. Memoryless Algorithms for the Generalized k-server Problem on Uniform Metrics;Approximation and Online Algorithms;2021