Abstract
Many load balancing algorithms balance the load according to a certain topology. Its choice can significantly influence the performance of the algorithm. We consider a two phase balancing model. The first phase calculates a balancing flow with respect to a topology by applying a diffusion scheme. The second phase migrates the load according to the balancing flow. The cost functions of the phases depend on various properties of the topology; for the first phase these are the maximum node degree and the number of eigenvalues of the network topology, for the second phase these are a small flow volume and a small diameter of the topology. We compare and propose various network topologies with respect to these properties. Experiments on a Cray T3E and on a cluster of PCs confirm our cost functions for both balancing phases.
Supported by German Science Foundation (DFG) Project SFB-376, EU ESPRIT LTR Project 20244 (ALCOM-IT) and by EU TMR-grant ERB-FMGE-CT95-0052 (ICARUS 2).
Chapter PDF
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
N. Biggs. Algebraic Graph Theory, Second Edition. Cambridge University Press, 1974/1993.
F. Comellas. (degree,diameter)-graphs. http://www-mat.upc.es/grup_de_grafs/table_g.html.
D.M. Cvetkovic, M. Doob, and H. Sachs. Spectra of Graphs. Joh. Ambrosius Barth, 1995.
G. Cybenko. Load balancing for distributed memory multiprocessors. J. of Parallel and Distributed Computing, 7:279–301, 1989.
T. Decker. Virtual Data Space-Load balancing for irregular applications. Parallel Computing, 2000. To appear.
R. Diekmann, A. Frommer, and B. Monien. Efficient schemes for nearest neighbor load balancing. Parallel Computing, 25(7):789–812, 1999.
R. Elsasser, A. Frommer, B. Monien, and R. Preis. Optimal and alternating-direction load-balancing schemes. In EuroPar’99, LNCS 1685, pages 280–290, 1999.
G. Fertin, A. Raspaud, H. Schröder, O. Sykora, and I. Vrto. Diamater of Knödel graph. In Workshop on Graph-Theoretic Concepts in Computer Science ( WG), 2000. to appear.
B. Ghosh, S. Muthukrishnan, and M.H. Schultz. First and second order diffusive methods for rapid, coarse, distributed load balancing. In SPAA, pages 72–81, 1996.
M. C. Heydemann, N. Marlin, and S. Perennes. Cayley graphs with complete rotations. Technical Report 1155, L.R.I. Orsay, 1997.
Y.F. Hu and R.J. Blake. An improved diffusion algorithm for dynamic load balancing. Parallel Computing, 25(4):417–444, 1999.
Y.F. Hu, R.J. Blake, and D.R. Emerson. An optimal migration algorithm for dynamic load balancing. Concurrency: Prac. and Exp., 10(6):467–483, 1998.
W. Knodel. New gossips and telephones. Discrete Mathematics, 13:95, 1975.
G. Royle. Cages of higher valency. http://www.cs.uwa.edu.au/~gordon/cages/allcages.html.
P. Sanders. Analysis of nearest neighbor load balancing algorithms for random loads. Parallel Computing, 25:1013–1033, 1999.
K. Schloegel, G. Karypis, and V. Kumar. Multilevel diffusion schemes for repartitioning of adaptive meshes. J. of Parallel and Distributed Computing, 47(2): 109–124, 1997.
R.S. Varga. Matrix Iterative Analysis. Prentice-Hall, 1962.
C. Xu and F.C.M. Lau. Load Balancing in Parallel Computers. Kluwer, 1997.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Decker, T., Monien, B., Preis, R. (2000). Towards Optimal Load Balancing Topologies. In: Bode, A., Ludwig, T., Karl, W., Wismüller, R. (eds) Euro-Par 2000 Parallel Processing. Euro-Par 2000. Lecture Notes in Computer Science, vol 1900. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44520-X_37
Download citation
DOI: https://doi.org/10.1007/3-540-44520-X_37
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-67956-1
Online ISBN: 978-3-540-44520-3
eBook Packages: Springer Book Archive