Results 1  10
of
22,350
The Harmonic kServer Algorithm is Competitive
 Journal of the ACM
, 1991
"... The kserver 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 kserver problem. We give a simple proof that the Harmonic kserver algorith ..."
Abstract

Cited by 30 (4 self)
 Add to MetaCart
The kserver 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 kserver problem. We give a simple proof that the Harmonic kserver
Competitive kServer Algorithms
, 1991
"... In this paper we give deterministic competitive kserver algorithms for all k and all metric spaces. This settles the kserver conjecture up to the competitive ratio, The best previous result for general metric spaces was a threeserver randomized competitive algorithm and a nonconstructive proof t ..."
Abstract
 Add to MetaCart
In this paper we give deterministic competitive kserver algorithms for all k and all metric spaces. This settles the kserver conjecture up to the competitive ratio, The best previous result for general metric spaces was a threeserver randomized competitive algorithm and a nonconstructive proof
Competitive kServer Algorithms
 Journal of Computer and System Sciences
, 1990
"... In this paper we give deterministic competitive kserver algorithms for all k and all metric spaces. This settles the kserver conjecture [MMS] up to the competitive ratio. The best previous result for general metric spaces was a 3server randomized competitive algorithm [BKT] and a nonconstructive ..."
Abstract

Cited by 58 (4 self)
 Add to MetaCart
In this paper we give deterministic competitive kserver algorithms for all k and all metric spaces. This settles the kserver conjecture [MMS] up to the competitive ratio. The best previous result for general metric spaces was a 3server randomized competitive algorithm [BKT] and a non
On the kServer Conjecture
 Journal of the ACM
, 1995
"... We prove that the work function algorithm for the kserver problem has competitive ratio at most 2k \Gamma 1. Manasse, McGeoch, and Sleator [24] conjectured that the competitive ratio for the kserver problem is exactly k (it is trivially at least k); previously the best known upper bound was ex ..."
Abstract

Cited by 110 (6 self)
 Add to MetaCart
We prove that the work function algorithm for the kserver problem has competitive ratio at most 2k \Gamma 1. Manasse, McGeoch, and Sleator [24] conjectured that the competitive ratio for the kserver problem is exactly k (it is trivially at least k); previously the best known upper bound
The Harmonic Algorithm for kserver Problem
"... The online kserver problem was introduced by Manasse. We are given initial locations of k servers in a matric space in which there is a distant function d.Requests for service at point {xt} come in over time. Immediately after the t th request is received, one of the servers must be moved from ..."
Abstract
 Add to MetaCart
The online kserver problem was introduced by Manasse. We are given initial locations of k servers in a matric space in which there is a distant function d.Requests for service at point {xt} come in over time. Immediately after the t th request is received, one of the servers must be moved from
More on Random Walks, Electrical Networks, and the Harmonic kServer Algorithm
, 2003
"... Techniques from electrical network theory have been used to establish various properties of random walks. We explore this connection further, by showing how the classical formulas for the determinant and cofactors of the admittance matrix, due to Maxwell and Kirchoff, yield upper bounds on the ed ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
, we obtain that the harmonic algorithm for the k server problem is 1/2 k(k + 1)competitive against the lazy adversary.
More on Random Walks, Electrical Networks and the Harmonic kServer Algorithm
, 2001
"... Abstract Techniques from electrical network theory have been used to establish various properties of random walks. We explore this connection further, by showing how the classical formulas for the determinant and cofactors of the admittance matrix, due to Maxwell and Kirchoff, yield upper bounds on ..."
Abstract
 Add to MetaCart
consequence, we obtain that the harmonic algorithm for the k server problem is1 2 k(k + 1)competitive against the lazy adversary. 1 Introduction Random walks and electrical networks. Let G be a complete undirected graph with n vertices numbered 1; 2; : : : ; n, in which each edge (u; v) is assigned its
The Kserver problem with distinguishable servers
, 1991
"... This report gives a survey of existing results in the field of online kserver algorithms and presents some new findings. The survey includes optimal online algorithms for k servers on a line or a tree, an optimal online algorithm for 2 servers in any metric space, and an optimal online algorith ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
line algorithm for n − 1 servers in a metric space with n points. The first part of the newer material pertains to the traditional kserver problem. The equivalence of the Tree and Line Potential Functions is discussed. An algorithm is given that works in any finite metric space with a competitiveness
A PolylogarithmicCompetitive Algorithm for the kServer Problem
"... We give the first polylogarithmiccompetitive randomized online algorithm for the kserver problem on an arbitrary finite metric space. In particular, our algorithm achieves a competitive ratio of Õ(log3 n log 2 k) for any metric space on n points. Our algorithm improves upon the deterministic (2k − ..."
Abstract

Cited by 11 (0 self)
 Add to MetaCart
We give the first polylogarithmiccompetitive randomized online algorithm for the kserver problem on an arbitrary finite metric space. In particular, our algorithm achieves a competitive ratio of Õ(log3 n log 2 k) for any metric space on n points. Our algorithm improves upon the deterministic (2k
Results 1  10
of
22,350