Optimal Broadcast in All-Port Wormhole-Routed Hypercubes
IEEE Transactions on Parallel and Distributed Systems
A near-optimal broadcasting algorithm in all-port wormhole-routed hypercubes
ICS '95 Proceedings of the 9th international conference on Supercomputing
Circuit-Switched Broadcasting in Torus Networks
IEEE Transactions on Parallel and Distributed Systems
Circuit-Switched Broadcasting in Torus and Mesh Networks
IEEE Transactions on Parallel and Distributed Systems
A Dilated-Diagonal-Based Scheme for Broadcast in a Wormhole-Routed 2D Torus
IEEE Transactions on Computers
Optimal Multicast Communication in Wormhole-Routed Torus Networks
IEEE Transactions on Parallel and Distributed Systems
Circuit-Switched Broadcast in Multi-Port 2D Tori
HPCN Europe '99 Proceedings of the 7th International Conference on High-Performance Computing and Networking
Optimal broadcast in /spl alpha/-port wormhole-routed mesh networks
ICPADS '97 Proceedings of the 1997 International Conference on Parallel and Distributed Systems
Circuit-Switched Broadcasting in itd-Dimensional Tori and Meshes
Proceedings of the 8th International Symposium on Parallel Processing
Algebraic Foundations and Broadcasting Algorithms for Wormhole-Routed All-Port Tori
IEEE Transactions on Computers
| Hi-index | 0.00 |
This paper studies the one-to-all broadcast problem in a circuit-switched torus with 驴-port capability, where a node can simultaneously send and receive 驴 messages at one time. We show how to efficiently perform broadcast in 2-D and 3-D tori of any size, square or non-square, using near optimal numbers of steps. The main techniques used are: (i) a "span-by-dimension" approach, which makes our solution scalable to torus dimensions, and (ii) a "squeeze-then-expand" approach, which makes possible solving the difficult cases where tori are non-square. Existing results, as compared to ours, can only solve very restricted sizes or dimensions of tori, or use more numbers of steps.