ComPaSS: efficient communication services for scalable architectures
Proceedings of the 1992 ACM/IEEE conference on Supercomputing
Unicast-Based Multicast Communication in Wormhole-Routed Networks
IEEE Transactions on Parallel and Distributed Systems
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Deadlock-Free Multicast Wormhole Routing in 2-D Mesh Multicomputers
IEEE Transactions on Parallel and Distributed Systems
MultiSim: A Simulation Tool for the Study of Large-Scale Multiprocessors
MASCOTS '93 Proceedings of the International Workshop on Modeling, Analysis, and Simulation On Computer and Telecommunication Systems
Document for a Standard Message-Passing Interface
Document for a Standard Message-Passing Interface
Optimal Broadcasting in Mesh-Connected Architectures
Optimal Broadcasting in Mesh-Connected Architectures
A near-optimal broadcasting algorithm in all-port wormhole-routed hypercubes
ICS '95 Proceedings of the 9th international conference on Supercomputing
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
Efficient Broadcasting in Wormhole-Routed Multicomputers: A Network-Partitioning Approach
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
Fault-Tolerant Multicast Routing in the Mesh with No Virtual Channels
HPCA '96 Proceedings of the 2nd IEEE Symposium on High-Performance Computer Architecture
A Recursion-Based Broadcast Paradigm in Wormhole Routed Networks
IEEE Transactions on Parallel and Distributed Systems
| Hi-index | 0.00 |
A new model for broadcast in wormhole-routed networks is proposed. The model uses and extends the concept of dominating sets in order to systematically develop efficient broadcast algorithms for all-port wormhole-routed systems, in which each node can simultaneously transmit messages on different outgoing channels. In this paper, two broadcast algorithms for two-dimensional (2D) mesh networks are presented. In the first approach, the source node uses a multicast algorithm to deliver the message to a set of dominating nodes, which can subsequently deliver the message to all other nodes in the network in a single message-passing step. This algorithm requires at most [log2N] steps, where N is the total number of nodes in the network, although in many cases only [log2N]−1 steps are needed. The second algorithm, called the D-node algorithm, reduces the number of steps by using multiple levels of dominating nodes in a recursive manner. For square meshes containing N=22(k+2) nodes, k≥0, the D-node algorithm requires at most k+4 steps. Similar upper bounds are shown to hold for meshes of other sizes and shapes. For specific source nodes and mesh shapes, the number of steps is shown to equal the theoretical lower bound of [log5N]. A simulation study confirms the advantage of the D-node algorithm, under various system parameters and conditions, over other broadcast algorithms.