Abstract
The mesh of trees is an interesting topology of distributedmemory parallel machine to implement severall parallel algorithms (sorting, algorithms on matrices,...). [3]. In this way, we study communication problems in this toporogy, and in particular we want to find good methods to broadcast a message in [2]. Because the mesh of trees is constructed from complete binary trees [3], we first present different broadcasting schemes in trees, and then we use this schemes to define an efficient algorithm of broadcasting in the mesh of trees [1] in at most 5n + [n/2] + 1 communication steps.
This is a preview of subscription content, log in via an institution to check access.
References
D. Barth: An Algorithm of Broadcasting in the Mesh of Trees. Research Report, LaBRI, Université de Bordeaux I, 1992.
P. Fraigniaud, E. Lazard: Methods and problems of communication in usual networks. Research Report n.701, L.R.I., Université Paris Sud, Centre d'Orsay, 1991.
F.T. Leigthon: Introduction to Parallel Algorithms and Architectures. Morgann Kaufmann Publishers, 1992.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1992 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Barth, D. (1992). An algorithm of broadcasting in the mesh of trees. In: Bougé, L., Cosnard, M., Robert, Y., Trystram, D. (eds) Parallel Processing: CONPAR 92—VAPP V. VAPP CONPAR 1992 1992. Lecture Notes in Computer Science, vol 634. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-55895-0_517
Download citation
DOI: https://doi.org/10.1007/3-540-55895-0_517
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-55895-8
Online ISBN: 978-3-540-47306-0
eBook Packages: Springer Book Archive