An on-line algorithm for solving the k-server problem operates under the additional constraint that it must decide which server to move to satisfy a given ...
That is, we seek to develop on-line algorithms whose performance on any sequence of requests is as close as possible to the performance of the optimum off-line ...
An optimal online algorithm for metrical task systems ; Sequencing problems in two-server systems. Math. Oper. Res. (1985) ; Sequencing two servers on a sphere ...
A competitive algorithm for an on-line problem has the property that its performance on any sequence of requests is within a constant factor of the performance ...
Off-line solutions to the k-server problem know the whole input in advance and can therefore provide optimal serving, contrary to any on-line procedure, ...
The k -server problem is a problem of theoretical computer science in the category of online algorithms, one of two abstract problems on metric spaces that are ...
May 1, 1990 · Deterministic competitive k-server algorithms are given for all k and all metric spaces. This settles the k-server conjecture of M.S. ...
People also ask
What is the weighted K-server problem?
What is the K-server problem?
Abstract— We give the first polylogarithmic-competitive ran- domized algorithm for the k-server problem on an arbitrary finite metric space.
Abstract. In this paper we give deterministic competitive k-server algorithms for all k and all metric spaces. This settles the k-server conjecture [MMS] up ...
We have obtained 3competitive algorithms for the migration problem on the complete network ... establish new results in the arca of competitive algorithm analysis ...