Computer Science (HMC), Mathematics (HMC)
Multicast communication has applications in a number of fundamental operations in parallel computing. An effective multicast routing algorithm must be free from both livelock and deadlock while minimizing communication latency. We describe two classes of multicast wormhole routing algorithms that employ the multi-destination wormhole hardware mechanism proposed by Lin et al.  and Panda et al. . Specific examples of these classes of algorithms are described and experimental results suggests that such algorithms enjoy low communication latencies across a range of network loads.
© 1997 World Academy of Science
R. Libeskind-Hadas, T. Hehre, A. Hutchings, M. Reyes, and K. Watkins, “Adaptive Multicast Routing in Wormhole Networks,” Proceedings of the Ninth IASTED International Conference on Parallel and Distributed Computing and Systems, October 1997, Washington D.C, pp. 513-522.