Berenbrink, P. and Friedetzky, T. and Martin, R. (2005) 'Dynamic diffusion load balancing.', in Automata, languages and programming : 32nd International Colloquium, ICALP 2005, 11-15 July 2005, Lisbon, Portugal ; proceedings. Berlin: Springer, pp. 1386-1398. Lecture notes in computer science. (3580).
We consider the problem of dynamic load balancing in arbitrary (connected) networks on n nodes. Our load generation model is such that during each round, n tasks are generated on arbitrary nodes, and then (possibly after some balancing) one task is deleted from every non-empty node. Notice that this model fully saturates the resources of the network in the sense that we generate just as many new tasks per round as the network is able to delete. We show that even in this situation the system is stable, in that the total load remains bounded (as a function of n alone) over time. Our proof only requires that the underlying “communication” graph be connected. (It of course also works if we generate less than n new tasks per round, but the major contribution of this paper is the fully saturated case.) We further show that the upper bound we obtain is asymptotically tight (up to a moderate multiplicative constant) by demonstrating a corresponding lower bound on the system load for the particular example of a linear array (or path). We also show some simple negative results (i.e., instability) for work-stealing based diffusion-type algorithms in this setting.
|Item Type:||Book chapter|
|Keywords:||Network, Algorithm, Load generation model.|
|Full text:||PDF (Copyright agreement prohibits open access to the full-text) - Accepted Version |
Publisher-imposed embargo (182Kb)
|Publisher Web site:||http://dx.doi.org/10.1007/11523468_112|
|Record Created:||04 Nov 2008|
|Last Modified:||09 Oct 2014 13:07|
|Social bookmarking:||Export: EndNote, Zotero | BibTex|
|Usage statistics||Look up in GoogleScholar | Find in a UK Library|