The Community for Technology Leaders
High Performance Computing and Grid in Asia Pacific Region, International Conference on (1997)
Seoul, Korea
Apr. 28, 1997 to May 2, 1997
ISBN: 0-8186-7901-8
pp: 248
Yu-Chee Tseng , National Central University
Ming-Chih Du , National Central University
Tong-Ying Juang , National Central University
ABSTRACT
In this paper, we propose three strategies for building a multicasting tree in a high-speed network. These strategies can be used in any network topology. The first one is based on voting, the second based on constructing a minimum spanning tree, and the third based on repeatedly constructing multiple minimum spanning trees. To demonstrate the effectiveness of these strategies, we show how to apply them to hypercubes and star graphs. Experimental results are reported to evaluate the performance of these solutions.
INDEX TERMS
ATM network, collective communication, high-speed network, hypercube, star graph, multicasting
CITATION
Yu-Chee Tseng, Ming-Chih Du, Tong-Ying Juang, "Some Heuristics and Experiments for Building a Multicasting Tree in a High-Speed Network", High Performance Computing and Grid in Asia Pacific Region, International Conference on, vol. 00, no. , pp. 248, 1997, doi:10.1109/HPC.1997.592155
93 ms
(Ver 3.3 (11022016))