The iPSC/2 direct-connect communications technology
C3P Proceedings of the third conference on Hypercube concurrent computers and applications: Architecture, software, computer systems, and general issues - Volume 1
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 Broadcast Algorithm for All-Port Wormhole-Routed Torus 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
Toward Optimal Complete Exchange on Wormhole-Routed Tori
IEEE Transactions on Computers
Algebraic Foundations and Broadcasting Algorithms for Wormhole-Routed All-Port Tori
IEEE Transactions on Computers
Optimal Multicast Communication in Wormhole-Routed Torus Networks
IEEE Transactions on Parallel and Distributed Systems
CCL: A Portable and Tunable Collective Communication Library for Scalable Parallel Computers
Proceedings of the 8th International Symposium on Parallel Processing
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
Hi-index | 0.00 |
The one-to-all broadcast is the most primary collective communication pattern in a multicomputer network. This paper studies this problem in a circuit-switched torus with α-port capability, where a node can simultaneously send and receive α messages at one time. This is a generalization of the one-port and all-port models. We show how to efficiently perform broadcast in tori of any dimension, any size, square or nonsquare, 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.