Randomized diffusion for indivisible loads

• Published in: Journal of computer and system sciences Vol. 81; no. 1; pp. 159 - 185
• Main Authors: Berenbrink, Petra, Cooper, Colin, Friedetzky, Tom, Friedrich, Tobias, Sauerwald, Thomas
• Format: Journal Article
• Language: English
• Published: Elsevier Inc 01.02.2015
• Subjects: Diffusion; Distributed computing; Load balancing; Random walk; Randomized algorithms; Randomized algorithms; Load balancing; Diffusion; Distributed computing; Random walk
• ISSN: 0022-0000; 1090-2724
• DOI: 10.1016/j.jcss.2014.04.027

We present a new randomized diffusion-based algorithm for balancing indivisible tasks (tokens) on a network. Our aim is to minimize the discrepancy between the maximum and minimum load. The algorithm works as follows. Every vertex distributes its tokens as evenly as possible among its neighbors and itself. If this is not possible without splitting some tokens, the vertex redistributes its excess tokens among all its neighbors randomly (without replacement). In this paper we prove several upper bounds on the load discrepancy for general networks. These bounds depend on some expansion properties of the network, that is, the second largest eigenvalue, and a novel measure which we refer to as refined local divergence. We then apply these general bounds to obtain results for some specific networks. For constant-degree expanders and torus graphs, these yield exponential improvements on the discrepancy bounds. For hypercubes we obtain a polynomial improvement. •Presentation of new algorithm for balancing discrete loads.•Algorithm is very natural and avoids nodes having negative loads.•Quality measure is the gap between maximum and minimum load, called discrepancy.•Upper bounds on discrepancy after algorithm has run as long as its continuous counterpart.