Optimum Broadcasting and Personalized Communication in Hypercubes
IEEE Transactions on Computers
A dominating set model for broadcast in all-port wormhole-routed 2D mesh networks
ICS '94 Proceedings of the 8th international conference on Supercomputing
Unicast-Based Multicast Communication in Wormhole-Routed Networks
IEEE Transactions on Parallel and Distributed Systems
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
On the Design and Implementation of Broadcast and Global Combine Operations Using the Postal Model
IEEE Transactions on Parallel and Distributed Systems
Broadcasting on meshes with wormhole routing
Journal of Parallel and Distributed Computing
A Broadcast Algorithm for All-Port Wormhole-Routed Torus Networks
IEEE Transactions on Parallel and Distributed Systems
IEEE Transactions on Parallel and Distributed Systems
A Dilated-Diagonal-Based Scheme for Broadcast in a Wormhole-Routed 2D Torus
IEEE Transactions on Computers
Efficient Broadcasting in Wormhole-Routed Multicomputers: A Network-Partitioning Approach
IEEE Transactions on Parallel and Distributed Systems
Algebraic Foundations and Broadcasting Algorithms for Wormhole-Routed All-Port Tori
IEEE Transactions on Computers
Near-Optimal Broadcast in All-Port Wormhole-Routed Hypercubes Using Error-Correcting Codes
IEEE Transactions on Parallel and Distributed Systems
Advanced Computer Architecture: Parallelism,Scalability,Programmability
Advanced Computer Architecture: Parallelism,Scalability,Programmability
The Alpha 21364 Network Architecture
IEEE Micro
Optimal Multicast Communication in Wormhole-Routed Torus Networks
IEEE Transactions on Parallel and Distributed Systems
A Recursion-Based Broadcast Paradigm in Wormhole Routed Mesh/Torus Networks
IPDPS '02 Proceedings of the 16th International Parallel and Distributed Processing Symposium
Broadcast in All-Port Wormhole-Routed 3D Mesh Networks Using Extended Dominating Sets
Proceedings of the 1994 International Conference on Parallel and Distributed Systems
An overview of the BlueGene/L Supercomputer
Proceedings of the 2002 ACM/IEEE conference on Supercomputing
A broadcast algorithm for all-port wormhole-routed torus networks
FRONTIERS '95 Proceedings of the Fifth Symposium on the Frontiers of Massively Parallel Computation (Frontiers'95)
| Hi-index | 0.00 |
A novel broadcast technique for wormhole-routed parallel computers based on recursion is presented in this paper. It works by partitioning the interconnection graph into a number of higher-level subgraphs. Then, we identify the Transmission SubGraph (TSG) in each subgraph. Both the higher-level subgraphs and the TSGs are recursively defined, i.e., we split each level i subgraph into several level i+1 subgraphs and identify-level i+1TSGs accordingly. We first split and scatter the source message into the TSG of the original graph. Next, in each recursive round message transmissions are from lower-level TSGs to higher-level TSGs and all transmissions at the same level happen concurrently. The algorithm proceeds recursively from lower-level subgraphs to higher level subgraphs until each highest-level subgraph (a single node) gets the complete message. We have applied this general paradigm to a number of topologies including two or higher dimension mesh/torus and hypercube. Our results show considerable improvements over all other algorithms for a wide range of message sizes under both one-port and all-port models.