Tight & Simple Load Balancing

We consider the following load balancing process for m tokens distributed arbitrarily among n nodes connected by a complete graph. In each time step a pair of nodes is selected uniformly at random. Let ℓ_1 and ℓ_2 be their respective number of tokens. The two nodes exchange tokens such that they have ⌈(ℓ_1 + ℓ_2)/2⌉ and ⌈(ℓ_1 + ℓ_2)/2⌉ tokens, respectively. We provide a simple analysis showing that this process reaches almost perfect balance within O(n log n + n log Δ) steps with high probability, where Δ is the maximal initial load difference between any two nodes. This bound is asymptotically tight.

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

[2]  Thomas Sauerwald,et al.  A simple approach for adapting continuous load balancing processes to discrete settings , 2016, Distributed Computing.

[3]  Paul W. Goldberg,et al.  Bounds for the convergence rate of randomized local search in a multiplayer load-balancing game , 2004, PODC '04.

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

[5]  Martin Hoefer,et al.  Distributed algorithms for QoS load balancing , 2011, Distributed Computing.

[6]  Harald Niederreiter,et al.  Probability and computing: randomized algorithms and probabilistic analysis , 2006, Math. Comput..

[7]  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).

[8]  S. Muthukrishnan,et al.  Dynamic Load Balancing by Random Matchings , 1996, J. Comput. Syst. Sci..

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

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

[11]  Thomas Sauerwald,et al.  Tight Bounds for Randomized Load Balancing on Arbitrary Network Topologies , 2012, 2012 IEEE 53rd Annual Symposium on Foundations of Computer Science.

[12]  Martin Hoefer,et al.  Threshold Load Balancing in Networks , 2013, ArXiv.

[13]  Johannes Gehrke,et al.  Gossip-based computation of aggregate information , 2003, 44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings..

[14]  Berthold Vöcking,et al.  Fast convergence to Wardrop equilibria by adaptive sampling methods , 2006, STOC '06.

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

[16]  Yves Mocquard,et al.  Optimal proportion computation with population protocols , 2016, 2016 IEEE 15th International Symposium on Network Computing and Applications (NCA).

[17]  Petra Berenbrink,et al.  Tight Load Balancing Via Randomized Local Search , 2017, 2017 IEEE International Parallel and Distributed Processing Symposium (IPDPS).