The Community for Technology Leaders
Green Image
<p><b>Abstract</b>—A new approach to broadcast in wormhole-routed two- and three-dimensional torus networks is proposed. The underlying network is assumed to support only deterministic, dimension-ordered unicast routing. The approach extends the graph theoretical concept of dominating nodes by accounting for the relative distance-insensitivity of the wormhole routing switching strategy. The proposed algorithm also takes advantage of an <it>all-port</it> communication architecture, which allows each node to simultaneously transmit messages on different outgoing channels. The resulting broadcast operation is based on a tree structure that uses multiple levels of <it>extended dominating nodes</it> (EDNs). Performance results are presented that confirm the advantage of this method over other approaches.</p>
Broadcast, collective communication, torus, wormhole routing, all-port, dominating set.
Philip K. McKinley, Yih-jia Tsai, "A Broadcast Algorithm for All-Port Wormhole-Routed Torus Networks", IEEE Transactions on Parallel & Distributed Systems, vol. 7, no. , pp. 876-885, August 1996, doi:10.1109/71.532118
108 ms
(Ver 3.3 (11022016))