Abstract
In this paper, we show that 3-D meshes of trees allow an elegant and optimal one-to-all broadcast algorithm supposing routers with distance-insensitive switching and all-output-port capability.
This research has been supported by MĹ MT research program #J04/98:212300014, by ÄŚVUT grant #300009203, and by FRVĹ grant #580/2000.
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
D. Barth. An algorithm of broadcasting in the mesh of trees. In CONPAR 92-VAPP, volume 634 of LNCS, pages 843–844. Springer-Verlag, 1992.
J.-Y. L. Park and H.-A. Choi. Circuit-switched broadcasting in torus and mesh networks. IEEE Trans. on Parallel and Distributed Systems, 7(2):184–190, 1996.
P. Salinger and P. TvrdĂk. Optimal broadcasting and gossiping in one-port wormhole meshes of trees. In PDCS’99, volume 2, pages 713–718. Acta Press, 1999.
P. Salinger and P. TvrdĂk. Optimal broadcasting in all-port meshes of trees with distance-insensitive routing. In IPDPS’00, pages 353–358. IEEE CS Press, 2000.
Y.-C. Tseng. A dilated-diagonal-based scheme for broadcast in a wormhole-routed 2D torus. IEEE Trans. on Computers, 46(8):947–952, 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
Salinger, P., TvrdĂk, P. (2000). Broadcasting in All-Port Wormhole 3-D Meshes of Trees. 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_130
Download citation
DOI: https://doi.org/10.1007/3-540-44520-X_130
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