The Community for Technology Leaders
Green Image
<p>Multicast communication, in which the same message is delivered from a source node toan arbitrary number of destination nodes, is being increasingly demanded in parallelcomputing. System supported multicast services can potentially offer improvedperformance, increased functionality, and simplified programming, and may in turn be used to support various higher-level operations for data movement and global process control. This paper presents efficient algorithms to implement multicast communication in wormhole-routed direct networks, in the absence of hardware multicast support, byexploiting the properties of the switching technology. Minimum-time multicast algorithms are presented for n-dimensional meshes and hypercubes that use deterministic,dimension-ordered routing of unicast messages. Both algorithms can deliver a multicastmessage to m-1 destinations in [log/sub 2/ m] message passing steps, while avoidingcontention among the constituent unicast messages. Performance results ofimplementations on a 64-node nCUBE-2 hypercube and a 168-node Symult 2010 2-Dmesh are given.</p>
Index Termsmessage passing; hypercube networks; performance evaluation; unicast-based multicastcommunication; wormhole-routed networks; destination nodes; parallel computing;performance; functionality; global process control; n-dimensional meshes; hypercubes;dimension-ordered routing; unicast messages; message passing; nCUBE-2 hypercube;168-node Symult 2010 2-D mesh

H. Xu, L. Ni, P. McKinley and A. Esfahanian, "Unicast-Based Multicast Communication in Wormhole-Routed Networks," in IEEE Transactions on Parallel & Distributed Systems, vol. 5, no. , pp. 1252-1265, 1994.
93 ms
(Ver 3.3 (11022016))