The Community for Technology Leaders
Green Image
<p><it>Abstract</it>—This paper presents efficient algorithms that implement one-to-many, or multicast, communication in wormhole-routed torus networks. By exploiting the properties of the switching technology and the use of virtual channels, a minimum-time multicast algorithm is presented for <it>n</it>-dimensional torus networks that use deterministic, dimension-ordered routing of unicast messages. The algorithm can deliver a multicast message to <it>m</it> - 1 destinations in <math><tmath>$\lceil {\bf log_2} \, {\mbi m} \rceil$</tmath></math> message-passing steps, while avoiding contention among the constituent unicast messages. Performance results of a simulation study on torus networks with up to 4096 nodes are also given.</p>
Multicast, wormhole routing, torus topology, virtual channels, routing algorithms, dimension-ordered routing.
David F. Robinson, Philip K. McKinley, Betty H.C. Cheng, "Optimal Multicast Communication in Wormhole-Routed Torus Networks", IEEE Transactions on Parallel & Distributed Systems, vol. 6, no. , pp. 1029-1042, October 1995, doi:10.1109/71.473513
92 ms
(Ver 3.3 (11022016))