Data communication in hypercubes
Journal of Parallel and Distributed Computing
Introduction to parallel algorithms and architectures: array, trees, hypercubes
Introduction to parallel algorithms and architectures: array, trees, hypercubes
Arrangement graphs: a class of generalized star graphs
Information Processing Letters
An efficient algorithm for multiple simultaneous broadcasts in the hypercube
Information Processing Letters
Partial multinode broadcast and partial exchange algorithms for d-dimensional meshes
Journal of Parallel and Distributed Computing
Parallel Divide and Conquer on Meshes
IEEE Transactions on Parallel and Distributed Systems
Scalable S-To-P Broadcasting on Message-Passing MPPs
IEEE Transactions on Parallel and Distributed Systems
Efficient Broadcasting in Wormhole-Routed Multicomputers: A Network-Partitioning Approach
IEEE Transactions on Parallel and Distributed Systems
Multiple Multicast with Minimized Node Contention on Wormhole k-ary n-cube Networks
IEEE Transactions on Parallel and Distributed Systems
Algebraic Foundations and Broadcasting Algorithms for Wormhole-Routed All-Port Tori
IEEE Transactions on Computers
Parallel Algorithms and Architectures
Parallel Algorithms and Architectures
High Performance Compilers for Parallel Computing
High Performance Compilers for Parallel Computing
Fault-Tolerant de Bruijn and Shuffle-Exchange Networks
IEEE Transactions on Parallel and Distributed Systems
Constructing independent spanning trees for locally twisted cubes
Theoretical Computer Science
On high performance multicast algorithms for interconnection networks
HPCC'06 Proceedings of the Second international conference on High Performance Computing and Communications
Design and analysis of multicast communication in multidimensional mesh networks
ISPA'07 Proceedings of the 5th international conference on Parallel and Distributed Processing and Applications
An algorithm to construct independent spanning trees on parity cubes
Theoretical Computer Science
Independent spanning trees in crossed cubes
Information Sciences: an International Journal
Dimension-adjacent trees and parallel construction of independent spanning trees on crossed cubes
Journal of Parallel and Distributed Computing
Parallel construction of independent spanning trees and an application in diagnosis on Möbius cubes
The Journal of Supercomputing
Hi-index | 0.00 |
In this paper, we investigate the multi-node broadcasting problem in a 3-D torus, where there are an unknown number of s source nodes located at unknown positions each intending to broadcast a message of size m bytes to the rest of the network. The torus is assumed to use the all-port model and the popular dimension-ordered routing. Existing congestion-free results are derived based on finding multiple edge-disjoint spanning trees in the network. This paper shows how to efficiently perform multi-node broadcasting in a 3-D torus. The main technique used in this paper is an aggregation-then-distribution strategy, which is characterized by the following features: (i) the broadcast messages are aggregated into some positions on the 3-D torus, then a number of independent subnetworks are constructed from the 3- D torus; and (ii) these subnetworks, which are responsible for distributing the messages, fully exploit the communication parallelism and the characteristic of wormhole routing. It is shown that such an approach is more appropriate than those using edge-disjoint trees for fixed-connection networks such as tori. Extensive simulations are conducted to evaluate this multi-broadcasting algorithm.