Abstract
This paper presents two tree-based multicast algorithms for wormhole-routed nD torus and 2D mesh networks, respectively. Both of the two algorithms use multiple spanning trees with an up-down routing strategy to provide deadlock-free routing. In contrast with single spanning tree algorithms that use non-tree links only as shortcuts, the presented algorithms use all links (for nD tori, all but n links) as tree links and, therefore, better balance network traffic and resource utilization. For the algorithm in 2D mesh networks, shortcuts can still be used to shorten routing path for both unicast and multicast messages. Simulation results show that both of the proposed algorithms outperform the best single spanning tree approach obviously.
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
W. J. Dally and C. L. Seitz, “The torus routing chip,” Journal of Distributed Computing, vol. 1, no. 3, pp. 187–196, 1986.
R. Sivaram, D. Panda, and C. Stunkel, “Multicasting in irregular networks with cutthrough switches using tree-based multidestination worms,” Proceedings of the 2nd Parallel Computing, Routing, and Communication Workshop, Jun. 1997.
M. P. Malumbres, J. Duato, and J. Torrellas, “An efficient implementation of tree-based multicast routing for distributed shared-memory multiprocessors,” Proceedings of the 8th IEEE Symposium on Parallel and Distributed Processing, pp. 186–189, Oct. 1996.
M. D. Schroeder, et al., “Autonet: A high-speed, self-configuring local area network using point-to-point links,” Technical Report 59, DEC SRC, Apr. 1990.
M. Gelar, P. Palnati, S. Walton, “Multicasting protocols for high-speed, worm-hole-routing local area networks,” Computer Communication Review, vol. 25, no.4, ](ACM SIGCOMM.96 Conference, Aug. 1996), pp. 184–193, ACM, Oct. 1996.
R. Libeskind-Hadas, D. Mazzoni, R. Rajagopalan, “Tree-based multicasting in wormhole-routed irregular topologies,” Proceedings of the 13th International Parallel Processing Symposium and 10th Symposium on Parallel and Distributed Processing, pp. 244–249, 1998.
R. Libeskind-Hadas, D. Mazzoni, R. Rajagopalan, “Tree-based multicasting in wormhole-routed irregular topologies,” Technical Report HMC-CS-97-02, Harvey Mudd College, Aug. 1997.
H. Wang and D. M. Blough, “Tree-based multicast in wormhole-routed torus networks,” Proceedings of the 1998 International Conference on Parallel and Distributed Processing Techniques and Applications, pp. 702–709, 1998.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Song, J., Hou, Z., Qu, Y. (2002). Efficient Tree-Based Multicast in Wormhole-Routed Networks. In: Sahni, S., Prasanna, V.K., Shukla, U. (eds) High Performance Computing — HiPC 2002. HiPC 2002. Lecture Notes in Computer Science, vol 2552. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-36265-7_28
Download citation
DOI: https://doi.org/10.1007/3-540-36265-7_28
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-00303-8
Online ISBN: 978-3-540-36265-4
eBook Packages: Springer Book Archive