Abstract
We present an optimal all-to-all communication procedure for a mesh connected topology of processors with wrap-around (a torus). This procedure is based on a spanning tree method and uses a reduced bufferization space.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Berge. Théorie des graphes. Gautiers-Villars, 1983.
S.M. Hedetniemi, S.T Hedetneimi, and A.L. Liestman. A survey of gossiping and broadcasting in communication networks. Networks, 18, 1986.
A.M.Farley and A.Proskurowski. Gossip in grid graphs. Journal of Combinatorics information and System Sciences, 5(2), 1980.
Y. Saad. Data communication in parallel architectures. Parallel Computing, (11), 1989.
D.M. Topkis. All-to-all broadcast by flooding in communication networks. IEEE Transactions on Computers, 38(9), September 1989.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1991 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Touzene, A., Plateau, B. (1991). Optimal multinode broadcast on a mesh connected graph with reduced bufferization. In: Bode, A. (eds) Distributed Memory Computing. EDMCC 1991. Lecture Notes in Computer Science, vol 487. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0032931
Download citation
DOI: https://doi.org/10.1007/BFb0032931
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-53951-3
Online ISBN: 978-3-540-46478-5
eBook Packages: Springer Book Archive