Dimension-Exchange Algorithms for Load Balancing on Trees

This paper considers dimension-exchange algorithms for load balancing on trees with finitely-divisible loads (token distribution). We present improved analysis of an existing protocol, and in particular, establish a logarithmic upper bound on the discrepancy of the final distribution. Our second contribution is a new algorithm, which assuming each node has knowledge of the total number of nodes, determines a perfectly balanced distribution.

[1]  Eli Upfal,et al.  The token distribution problem , 1989, 27th Annual Symposium on Foundations of Computer Science (sfcs 1986).

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

[3]  Eli Upfal,et al.  The Generalized Packet Routing Problem , 1987, Theor. Comput. Sci..

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

[5]  Michael E. Houle,et al.  Dimension-Exchange Token Distribution on the Mesh and the Torus , 1998, Parallel Comput..

[6]  Bruce M. Maggs,et al.  Tight analyses of two local load balancing algorithms , 1995, STOC '95.

[7]  Ewan D. Tempero,et al.  Optimal Dimension-Exchange Token Distribution on Complete Binary Trees , 1999, Theor. Comput. Sci..

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

[9]  Seyed Hossein Hosseini,et al.  Analysis of a Graph Coloring Based Distributed Load Balancing Algorithm , 1990, J. Parallel Distributed Comput..

[10]  Andy N. C. Kang,et al.  Some Properties of a Centroid of a Free Tree , 1975, Inf. Process. Lett..