Abstract
We investigate the following very simple load-balancing algorithm on the N-cycle (N even) which we call Odd-Even Transposition Balancing (OETB). The edges of the cycle are partitioned into two matchings canonically. A matching defines a single step, the two matchings form a single round. Processors connected by an edge of the matching perfectly balance their loads, and, if there is an excess token, it is sent to the lower-numbered processor. The difference between the real process where the tokens are assumed integral and the idealized process where the tokens are assumed divisible can be expressed in terms of the local divergence [1]. We show that Odd-Even Transposition Balancing has a local divergence of N/2 − 1. Combining this with previous results, this shows that after O(N 2log(KN)) rounds, any input sequence with initial imbalance K is perfectly balanced. Experiments are presented that show that the number of rounds necessary to perfectly balance a load sequence with imbalance K that has been obtained by pre-balancing a random sequence with much larger imbalance is significally larger than the average number of rounds necessary for balancing random sequences with imbalance K.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Rabani, Y., Sinclair, A., Wanka, R.: Local divergence of Markov chains and the analysis of iterative load-balancing schemes. In: Proc. 39th IEEE Foundations of Computer Science (FOCS), pp. 694–703 (1998)
Cybenko, G.: Dynamic load balancing for distributed memory multiprocessors. Journal of Parallel and Distributed Computing 7, 279–301 (1989)
Hosseini, S., Litow, B., Malkawi, M., McPherson, J., Vairavan, K.: Analysis of a graph coloring based distributed load balancing algorithm. Journal of Parallel and Distributed Computing 10, 160–166 (1990)
Aspnes, J., Herlihy, M., Shavit, N.: Counting networks. Journal of the ACM 41, 1020–1048 (1994)
Knuth, D.E.: The Art of Computer Programming, Sorting and Searching, vol. 3, 2nd edn. Addison-Wesley, Massachusetts (1998)
Busch, C., Mavronicolas, M.: A combinatorial treatment of balancing networks. Journal of the ACM 43, 794–983 (1996)
Bertsekas, D.P., Tsitsiklis, J.N.: Parallel and Distributed Computations: Numerical Methods. Prentice-Hall, Englewood Cliffs (1989)
Boillat, J.E.: Load balancing and Poisson equation in a graph. Concurrency: Practice and Experience 2, 289–313 (1990)
Aharonson, E., Attiya, H.: Counting networks with arbitrary fan-out. Distributed Computing 8, 163–169 (1995)
Rieß, C.: Load-Balancing auf dem Kreis. Studienarbeit, Department of Computer Science, University of Erlangen-Nuremberg (2006)
Bromwich, T.: An Introduction to the Theory of Infinite Series. MacMillan, NYC (1926)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Rieß, C., Wanka, R. (2007). Periodic Load Balancing on the N-Cycle: Analytical and Experimental Evaluation. In: Kermarrec, AM., Bougé, L., Priol, T. (eds) Euro-Par 2007 Parallel Processing. Euro-Par 2007. Lecture Notes in Computer Science, vol 4641. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-74466-5_86
Download citation
DOI: https://doi.org/10.1007/978-3-540-74466-5_86
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-74465-8
Online ISBN: 978-3-540-74466-5
eBook Packages: Computer ScienceComputer Science (R0)