On the k -server conjecture-Reference-Cited by-同舟云学术

On the k -server conjecture

Published:1995-09 Issue:5 Volume:42 Page:971-983
ISSN:0004-5411
Container-title:Journal of the ACM
language:en
Short-container-title:J. ACM

Author:

Koutsoupias Elias¹,Papadimitriou Christos H.²

Affiliation:

1. Univ. of California at Los Angeles, Los Angeles

2. Univ. of California at San Diego, La Jolla

Abstract

We prove that the work function algorithm for the k -server problem has a competitive ratio at most 2 k −1. Manasse et al. [1988] conjectured that the competitive ratio for the k -server problem is exactly k (it is trivially at least k ); previously the best-known upper bound was exponential in k . Our proof involves three crucial ingredients: A quasiconvexity property of work functions, a duality lemma that uses quasiconvexity to characterize the configuration that achieve maximum increase of the work function, and a potential function that exploits the duality lemma.

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/210118.210128

Reference24 articles.

1. On the power ~of randomization in on-line algorithms;~BEN-DAVID S.;Algorlthmzca,1994

2. ~BERMAN P. KARLOFF H. J. AND TARDOS G. 1990. A competitive three-server algorithm. In ~Proceedzngs of the 1st Annual ACM-S1AM Symposlt~m on Discrete Algorithms. ACM New York ~pp. 280-290. ~BERMAN P. KARLOFF H. J. AND TARDOS G. 1990. A competitive three-server algorithm. In ~Proceedzngs of the 1st Annual ACM-S1AM Symposlt~m on Discrete Algorithms. ACM New York ~pp. 280-290.

3. New Ressults on Server Problems

4. An Optimal On-Line Algorithm for K Servers on Trees

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

1. Toward Online Mobile Facility Location on General Metrics;Theory of Computing Systems;2023-10-06

2. Capacity-insensitive algorithms for online facility assignment problems on a line;Discrete Mathematics, Algorithms and Applications;2023-07-19

3. Improved and Deterministic Online Service with Deadlines or Delay;Proceedings of the 55th Annual ACM Symposium on Theory of Computing;2023-06-02

4. On the Adversarial Convex Body Chasing Problem;2023 American Control Conference (ACC);2023-05-31

5. Smoothed Online Optimization with Unreliable Predictions;Proceedings of the ACM on Measurement and Analysis of Computing Systems;2023-02-27