Strongly Adaptive Token Distribution 1

@inproceedings{Heide1997StronglyAT,
  title={Strongly Adaptive Token Distribution 1},
  author={Friedhelm Meyer auf der Heide and Brigitte Oesterdiekhoff and Rolf Wanka},
  year={1997}
}
The token distribution (TD) problem, an abstract static variant of load balancing, is defined as follows: let M be a (parallel processor) network with set P of processors. Initially, each processor P ∈ P has a certain amount l (P) of tokens. The goal of a TD algorithm, run on M , is to distribute the tokens evenly among the processors. In this paper we introduce the notion of strongly adaptive TD algorithms, i.e., algorithms whose running times come close to the best possible runtime, the off… CONTINUE READING