Adaptive Multicast Routing in Wormhole Networks
Ran Libeskind-Hadas, Tom Hehre, Andrew Hutchings, Mark Reyes, Kevin Watkins · Scholarship @ Claremont (The Claremont Colleges) · 1997
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 multidestination 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 suggest that such algorithms enjoy low communication latencies across a range of network loads. 1 Introduction The distributed memory multiprocessor paradigm provides a promising means of constructing scalable parallel computers. These systems comprise a collection of nodes, where each node consists of a processor with its own local memory and a router which supports message communication between nodes. The routers are connected by channels according to a particular interconnection topology. Among th...