Rapid convergence of a local load balancing algorithm for asynchronous rings

We consider the problem of load balancing in a ring network. We present an analysis of the following local algorithm. In each step, each node of the ring examines the number of tokens at its clockwise neighbor and sends a token to the neighbour if the neighbour has fewer tokens. We show that in a sy...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Theoretical computer science Jg. 220; H. 1; S. 247 - 265
Hauptverfasser: Gehrke, Johannes E., Plaxton, C.Greg, Rajaraman, Rajmohan
Format: Journal Article
Sprache:Englisch
Veröffentlicht: Elsevier B.V 06.06.1999
Schlagworte:
Asynchronous networks
Distributed algorithms
Load balancing
Ring topology
Ring topology
Load balancing
Distributed algorithms
Asynchronous networks
ISSN:0304-3975, 1879-2294
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:We consider the problem of load balancing in a ring network. We present an analysis of the following local algorithm. In each step, each node of the ring examines the number of tokens at its clockwise neighbor and sends a token to the neighbour if the neighbour has fewer tokens. We show that in a synchronous model, for any initial token distribution b on an n-node ring, the algorithm converges to a completely balanced distribution within 4 OPT( b) + n steps, where OPT( b) is the time taken by the optimal centralized algorithm to balance b completely. Our main result is an analysis of the algorithm in an asynchronous model in which local computations and messages may be arbitrarily delayed, subject to the constraint that each message is eventually delivered and each computation is eventually performed. By generalizing our analysis for the synchronous model, we show that for any initial token distribution b, the algorithm converges to a completely balanced distribution within 8 OPT( b) + 2 n rounds, where a round is a minimal sequence of steps in which every component of the network is scheduled at least once. We also show that for every initial token distribution, the message complexity of the algorithm is asymptotically optimal among all algorithms that move tokens in the clockwise direction.
ISSN:0304-3975
1879-2294
DOI:10.1016/S0304-3975(98)00243-6