Adaptive Multicast Routing in Wormhole Networks

Authors

Ran Libeskind-Hadas, Harvey Mudd CollegeFollow
Tom Hehre '96, Harvey Mudd College
Andrew Hutchings '98, Harvey Mudd College
Mark Reyes '98, Harvey Mudd College
Kevin Watkins '97, Harvey Mudd College

Student Co-author

HMC Undergraduate

Document Type

Conference Proceeding

Department

Computer Science (HMC), Mathematics (HMC)

Publication Date

1997

Abstract

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. [12] and Panda et al. [17]. 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.

Comments

Published in the proceedings of WORLDCOMP ( http://www.world-academy-of-science.org/ ) World Academy of Sciences, Las Vegas, USA.

Rights Information

© 1997 World Academy of Science

Recommended Citation

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.