A New Approach to the Server Problem
- 1 August 1991
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Discrete Mathematics
- Vol. 4 (3) , 323-328
- https://doi.org/10.1137/0404029
Abstract
A new method for dealing with the server problem is proposed. The technique consists ofembedding the given metric space M into a bigger metric space cl (M) called the closure of M ,and allowing our servers to move in cl (M ). We show how this technique can be applied to givea new optimal algorithm for two servers.1 IntroductionThe k server problem can be formulated as follows: Let M be a metric space, in which we havek mobile servers that can occupy points of M . Initially all servers...Keywords
This publication has 2 references indexed in Scilit:
- An Optimal On-Line Algorithm for K Servers on TreesSIAM Journal on Computing, 1991
- Memory versus randomization in on-line algorithmsPublished by Springer Nature ,1989