Improved Bounds for Discrete Diffusive Load Balancing

In this paper we consider load balancing in a static and discrete setting where a fixed number of indivisible tasks have to be allocated to processors. We assume uniform tasks but the processors may have different speeds. The load of a processor is the number of tasks assigned to it divided by its speed. We consider diffusion load balancing which works in rounds. In every round the processors are allowed to compare their own load with the load of their neighbors and to balance the load with the neighbors, using their local information only. The question is how many rounds does it take until the whole processor network is balanced, meaning the load discrepancy (difference between maximum load and m/n) is minimized. Our balancing algorithm is deterministic and extends the algorithm studied in [1] from the case of uniform speeds to non-uniform speeds. We use a potential function argument to show that a better load balance can be obtained when the algorithm is allowed to run longer compared to the algorithm of [1].

[1]  B. Mohar.  THE LAPLACIAN SPECTRUM OF GRAPHS y , 1991 .

[2]  Robert Elsässer,et al.  Load balancing of unit size tokens and expansion properties of graphs , 2003, SPAA '03.

[3]  Thomas Sauerwald,et al.  Near-perfect load balancing by randomized rounding , 2009, STOC '09.

[4]  Martin Hoefer,et al.  Distributed Selfish Load Balancing on Networks , 2014, TALG.

[5]  A. Klyachko.  Random walks on symmetric spaces and inequalities for matrix spectra , 2000 .

[6]  Ralf Diekmann,et al.  Efficient schemes for nearest neighbor load balancing , 1999, Parallel Comput..

[7]  Isaac D. Scherson,et al.  An analysis of diffusive load-balancing , 1994, SPAA '94.

[8]  Noga Alon,et al.  lambda1, Isoperimetric inequalities for graphs, and superconcentrators , 1985, J. Comb. Theory, Ser. B.

[9]  Robert Elsässer,et al.  Diffusion Schemes for Load Balancing on Heterogeneous Networks , 2002, Theory of Computing Systems.

[10]  Zengjian Hu,et al.  A new analytical method for parallel, diffusion-type load balancing , 2006, Proceedings 20th IEEE International Parallel & Distributed Processing Symposium.

[11]  S. Muthukrishnan,et al.  First- and Second-Order Diffusive Methods for Rapid, Coarse, Distributed Load Balancing , 1996, Theory of Computing Systems.

[12]  Jacques E. Boillat,et al.  Load Balancing and Poisson Equation in a Graph , 1990, Concurr. Pract. Exp..

[13]  P. Berenbrink,et al.  Randomized diffusion for indivisible loads , 2011, SODA 2011.

[14]  Yuval Rabani,et al.  Local divergence of Markov chains and the analysis of iterative load-balancing schemes , 1998, Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280).

[15]  Fan Chung,et al.  Spectral Graph Theory , 1996 .

[16]  H. Weyl.  Das asymptotische Verteilungsgesetz der Eigenwerte linearer partieller Differentialgleichungen (mit einer Anwendung auf die Theorie der Hohlraumstrahlung) , 1912 .

[17]  Rajendra Bhatia,et al.  Linear Algebra to Quantum Cohomology: The Story of Alfred Horn's Inequalities , 2001, Am. Math. Mon..

[18]  George Cybenko,et al.  Dynamic Load Balancing for Distributed Memory Multiprocessors , 1989, J. Parallel Distributed Comput..

[19]  N. Alon,et al.  il , , lsoperimetric Inequalities for Graphs , and Superconcentrators , 1985 .

[20]  Petra Berenbrink,et al.  Distributed selfish load balancing with weights and speeds , 2012, PODC '12.

[21]  Thomas Sauerwald,et al.  Quasirandom Load Balancing , 2012, SIAM J. Comput..

[22]  Robert Elsässer,et al.  Distributing Unit Size Workload Packages in Heterogeneous Networks , 2006, J. Graph Algorithms Appl..