Abstract
We present the analysis of a randomized load distribution algorithm that dynamically embed arbitrary trees in a distributed network with an arbitrary topology. We model a load distribution algorithm by an associeted Markov chain and we show that the randomized load distribution algorithm spreads any M-node tree in a distributed network with N vertices with load O(M/N + δ(ε)), where δ(ε) depends on the convergence rate of the associated Markov chain. Experimental results obtained by the implementation of these load distribution algorithms, to validate our framework, on the two-dimensional mesh of the massively parallel computer MasPar MP-1 with 16,384 processors, and on a network of workstations are also given.
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
S.N. Bhatt and J.-Y. Cai. Talk a walk, grow a tree. in Proc. 29th Annual IEEE Symposuim on Foundations of Computer, Science, IEEE CS, Washington, DC, pp. 469–478, 1988.
S.Bhatt and J-Y.Cai. Taking random walks to grow trees in hypercubes. Journal of the ACM, 40(3):741–764, July 1993.
F.T. Leighton, M.J. Newman, A.G. Ranade, and E.J. Schwabe. Dynamic tree embeddings in butterflies and hypercubes. Siam Journal on computing, 21(4):639–654, August 1992.
F.T. Leighton. Introduction to parallel algorithms and architectures, Morgan Kauffmann Publishers., 1992. Traduit en FranÇais par P.Fraignaud et E.Fleury, International Thomson publishing France, 1995.
K. Li. Analysis of randomized load distribution for reproduction trees in linear arrays and rings. Proc. 11th Annual International Symposium on High Performance Computers, Winnipeg, Manitoba, Canada (10–12), July, 1997.
J. Gaber. Plongement et manipulations d’arbres dans les architectures distribuées. Thèse LIFL, Janvier 1998.
G. Cybenko. Dynamic load balancing for distributed memory architecture. Journal of Parallel and Distributed Computing, 7:279–301, 1989.
Fan.R.K. Chung. Spectral Graph Theory. AMS., 1997.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1998 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Gaber, J., Toursel, B. (1998). Dynamic and randomized load distribution in arbitrary networks. In: Pritchard, D., Reeve, J. (eds) Euro-Par’98 Parallel Processing. Euro-Par 1998. Lecture Notes in Computer Science, vol 1470. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0057882
Download citation
DOI: https://doi.org/10.1007/BFb0057882
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-64952-6
Online ISBN: 978-3-540-49920-6
eBook Packages: Springer Book Archive