Abstract
We consider the problem of load balancing in a ring network. We present an analysis of the following local algorithm. In each step, each node of the ring examines the number of tokens at its clockwise neighbor and sends a token to the neighbor if the neighbor has fewer tokens. We show that in a synchronous model, for any initial token distribution b, the algorithm converges to a completely balanced distribution within 40PT(b) + n steps, where OPT(b) is the time taken by the optimal centralized algorithm to balance b completely. Our main result is an analysis of the algorithm in an asynchronous model in which local computations and messages may be arbitrarily delayed, subject to the constraint that each message is eventually delivered and each computation is eventually performed. By generalizing our analysis for the synchronous model, we show that for any initial token distribution b, the algorithm converges to a completely balanced distribution within 8OPT(b) + 2n rounds, where a round is a minimal sequence of steps in which every component of the network is scheduled at least once. We also show that for every initial token distribution, the message complexity of the algorithm is asymptotically optimal among all algorithms that move tokens in the clockwise direction.
Supported by the National Science Foundation under Grant No. CCR-9504145.
Part of this work was done while the authors were visiting the University of Paderbom.
Preview
Unable to display preview. Download preview PDF.
References
W. Aiello, B. Awerbuch, B. Maggs, and S. Rao. Approximate load balancing on dynamic and asynchronous networks. In Proceedings of the 25th Annual ACM Symposium on Theory of Computing, pages 632–641, May 1993.
E. Arjomandi, M. J. Fischer, and N. A. Lynch. Efficiency of synchronous versus asynchronous distributed systems. Journal of the ACM, 30:449–456, 1983.
A. Arora and M. Gouda. Load balancing: An exercise in constrained convergence. In J-M. Hé1ary and M. Raynal, editors, Proceedings of the 9th International Workshop on Distributed Algorithms, Lecture Notes in Computer Science, volume 972, pages 183–197. Springer-Verlag, 1995.
H. Attiya and M. Mavronicolas. Efficiency of semi-synchronous versus asynchronous networks. Mathematical Systems Theory, 27:547–571, 1994.
H. Attiya, M. Snir, and M. Warmuth. Computing on an anonymous ring. Journal of the ACM, 35:845–875, 1988.
B. Awerbuch. Complexity of network synchronization. Journal of the ACM, 32:804–823, 1985.
B. Awerbuch, L. Cowen, and M. Smith. Efficient asynchronous distributed symmetry breaking. In Proceedings of the 26th Annual ACM Symposium on the Theory of Computing, pages 214–223, 1994.
D. P. Bertsekas and J. N. Tsitsiklis. Parallel and Distributed Computation: Numerical Methods. Prentice-Hall, Englewood Cliffs, NJ, 1989.
E. Cohen. On the convergence span of greedy load balancing. Information Processing Letters, 52:181–182, 1994.
G. Cybenko. Dynamic load balancing for distributed memory multiprocessors. Journal of Parallel and Distributed Computing, 2:279–301, 1989.
X. Deng, H. N. Liu, L. Long, and B. Xiao. Competitive analysis of network load balancing. Journal of Parallel and Distributed Computing, 40:162–172, 1997.
D. Eager, D. Lazowska, and J. Zahorjan. Adaptive load sharing in homogeneous distributed systems. IEEE Transactions on Software Engineering, 12:662–675, 1986.
P. Fizzano, D. Karger, C. Stein, and J. Wein. Job scheduling in rings. In Proceedings of the 6th Annual ACM Symposium on Parallel Algorithms and Architectures, pages 210–219, June 1994.
G. Frederickson and N. Lynch. Electing a leader in a synchronous ring. Journal of the ACM, 34:98–115, 1987.
B. Ghosh, F. T. Leighton, B. M. Maggs, S. Muthukrishnan, C. G. Plaxton, R. Rajaraman, A. W. Richa, R. E. Tarjan, and D. Zuckerman. Tight analyses of two local load balancing algorithms. In Proceedings of the 27th Annual ACM Symposium on Theory of Computing, pages 548–558, May 1995.
A. Heirich and S. Taylor. A parabolic theory of load balance. Technical Report Caltech-CS-TR-93-22, Caltech Scalable Concurrent Computation Lab, March 1993.
D. Hutchinson. Local Area Network Architectures. Addison-Wesley, 1988.
L. Lamport and N. Lynch. Distributed computing: Models and methods. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, Volume B: Formal Models and Semantics, pages 1157–1199. Elsevier/MIT Press, 1990.
F. T. Leighton. Introduction to Parallel Algorithms and Architectures: Arrays, Trees, and Hypercubes. Morgan-Kaufmann, San Mateo, CA, 1991.
N. Lynch and M. Fisher. On describing the behavior and implementation of distributed systems. Theoretical Computer Science, 13:17–43, 1981.
F. Meyer auf der Heide, B. Oesterdiekhoff, and R. Wanka. Strongly adaptive token distribution. Algorithmica, 15:413–427, 1996.
D. Peleg and E. Upfal. The generalized packet routing problem. Theoretical Computer Science, 53:281–293, 1987.
D. Peleg and E. Upfal. The token distribution problem. SIAM Journal on Computing, 18:229–243, 1989.
C. G. Plaxton. Load balancing, selection, and sorting on the hypercube. In Proceedings of the 1st Annual ACM Symposium on Parallel Algorithms and Architectures, pages 64–73, June 1989.
A. Tanenbaum. Computer Networks. Prentice Hall, 1989.
A. N. Tantawi and D. Towsley. Optimal static load balancing in distributed computer systems. Journal of the ACM, 32:445–465, 1985.
R. D. Williams. Performance of dynamic load balancing algorithms for unstructured mesh calculations. Concurrency: Practice and Experience, 3:457–481, 1991.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1997 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Gehrke, J.E., Plaxton, C.G., Rajaraman, R. (1997). Rapid convergence of a local load balancing algorithm for asynchronous rings. In: Mavronicolas, M., Tsigas, P. (eds) Distributed Algorithms. WDAG 1997. Lecture Notes in Computer Science, vol 1320. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0030677
Download citation
DOI: https://doi.org/10.1007/BFb0030677
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-63575-8
Online ISBN: 978-3-540-69600-1
eBook Packages: Springer Book Archive