Competitive algorithms for the weighted server problem

```@article{Fiat1993CompetitiveAF,
title={Competitive algorithms for the weighted server problem},
author={Amos Fiat and Moty Ricklin},
journal={[1993] The 2nd Israel Symposium on Theory and Computing Systems},
year={1993},
pages={294-303}
}```
• Published 7 June 1993
• Computer Science, Mathematics
• [1993] The 2nd Israel Symposium on Theory and Computing Systems
The authors deal with a generalization of the k-server problem, in which the servers are unequal. In the weighted server model each of the servers is assigned a positive weight. The cost associated with moving a server equals the product of the distance traversed and the server weight. A weighted k-server algorithm is called competitive if the competitive ratio depends only upon the number of servers. (i.e., the competitive ratio is independent of the weights associated with the servers and the…

Figures from this paper

Randomized Memoryless Algorithms for the Weighted and the Generalized k-server Problems

• Computer Science, Mathematics
ACM Trans. Algorithms
• 2020
A framework for working with potential functions defined implicitly as the solution of a linear system is developed and tight bounds on the competitive ratio achievable by randomized memoryless algorithms for the weighted k-server problem on uniform metrics are established.

Competitive Algorithms for Generalized k-Server in Uniform Metrics

• Computer Science, Mathematics
SODA
• 2018
The generalized k-server problem is considered in uniform metrics and the first f(k)-competitive algorithms for general k are given, including a deterministic and randomized algorithms with competitive ratio \$O(k 2^k)\$ and \$O (k^3 \log k)\$ respectively.

Weighted k-Server Bounds via Combinatorial Dichotomies

• Computer Science, Mathematics
2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS)
• 2017
A doubly exponential lower bound on the competitive ratio of any deterministic online algorithm, that essentially matches the known upper bounds for the problem and closes a large and long-standing gap.

The k-Server Problem and Fractional Analysis

It is shown that on the line and circle, the randomized version of the k-server problem is equivalent to the fractional version, and the cases for which these versions are not equivalent are classified by presenting a fractional algorithm which cannot be simulated by any randomized algorithm.

The weighted 2-server problem

• Computer Science, Mathematics
Theor. Comput. Sci.
• 2000

The Randomized Competitive Ratio of Weighted \$k\$-server is at least Exponential

• Mathematics, Computer Science
ESA
• 2021
This paper cuts down the triply exponential gap between the upper and lower bound to a singly exponential gap by proving that the competitive ratio is at least exponential in k, substantially improving on the previously known lower bound of about ln k.

More on weighted servers or

A general lower bound for trackless algorithms depending on the cost ratio is presented, proving that the proposed algorithm is the best possible trackless algorithm up to a constant factor for any cost ratio.

On Randomized Memoryless Algorithms for the Weighted K-Server Problem

• Computer Science
2013 IEEE 54th Annual Symposium on Foundations of Computer Science
• 2013
This work proves that there is an α<sub>k</sub> competitive memoryless algorithm for the weighted k-server problem on uniform spaces, and develops a framework to bound from above the competitive ratio of any randomized memoryless algorithms for this problem.

Online Paging with Heterogeneous Cache Slots

• Mathematics, Computer Science
ArXiv
• 2022
The deterministic upper bound is extended to the weighted variant of All-or-One Paging (a generalization of standard Weighted Paging), showing that it is also Θ(k).

References

SHOWING 1-10 OF 16 REFERENCES

The K-Server Problem with Distinguishable Servers

A survey of existing results in the field of on-line k-server algorithms and some new findings is given and a variation of the k- server problem in which the servers have different costs is discussed.

New results on server problems

• Computer Science
SODA '90
• 1990
A fast algorithm for oflline computing of an optimal schedule is given, and it is shown that finding an optimal offline schedule is at least as hard as the assignment problem.

Competitive k-server algorithms

• Computer Science, Mathematics
Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science
• 1990
Deterministic competitive k-server algorithms are given for all k and all metric spaces and the competitive ratio can be proved is exponential in the number of servers, settling the k- server conjecture.

The harmonic online K-server algorithm is competitive

The Harmonic algorithm for the online K-server problem is shown to be competitive against an adaptive online adversary for K 22 and the best competitive ratios that have been published so far for online algorithms over a general metric space when K >2 are shown.

Competitive Paging Algorithms

• Computer Science
J. Algorithms
• 1991

An optimal online algorithm for metrical task systems

• Computer Science
STOC
• 1987
A general model for the processing of sequences of tasks and a general online decision algorithm are introduced and it is shown that this algorithm is optimal among all online algorithms.

Competitive algorithms for on-line problems

• Computer Science
STOC '88
• 1988
This paper presents several general results concerning competitive algorithms, as well as results on specific on-line problems.

Competitive algorithms for layered graph traversal

• Computer Science
[1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science
• 1991
For traversing layered graphs consisting of w disjoint paths tied together at a common source, the authors give a randomized online algorithm with a competitive ratio of O(log w) and prove that this is optimal up to a constant factor.

Amortized efficiency of list update and paging rules

• Computer Science
CACM
• 1985
This article shows that move-to-front is within a constant factor of optimum among a wide class of list maintenance rules, and analyzes the amortized complexity of LRU, showing that its efficiency differs from that of the off-line paging rule by a factor that depends on the size of fast memory.

Shortest Paths Without a Map

• Computer Science
Theor. Comput. Sci.
• 1989