Multicast tree construction in bus-based networks
Communications of the ACM
Multicast in hypercube multiprocessors
Journal of Parallel and Distributed Computing
Introduction to parallel algorithms and architectures: array, trees, hypercubes
Introduction to parallel algorithms and architectures: array, trees, hypercubes
Fault-tolerant multicasting on hypercubes
Journal of Parallel and Distributed Computing
A Trip-Based Multicasting Model in Wormhole-Routed Networks with Virtual Channels
IEEE Transactions on Parallel and Distributed Systems
Discrete Mathematics and Its Applications
Discrete Mathematics and Its Applications
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
A Routing and Broadcasting Scheme on Faulty Star Graphs
IEEE Transactions on Computers
Toward Optimal Broadcast in a Star Graph Using Multiple Spanning Trees
IEEE Transactions on Computers
Optimal Broadcasting on the Star Graph
IEEE Transactions on Parallel and Distributed Systems
A Comparative Study of Topological Properties of Hypercubes and Star Graphs
IEEE Transactions on Parallel and Distributed Systems
Optimal Multicast Communication in Wormhole-Routed Torus Networks
IEEE Transactions on Parallel and Distributed Systems
An Adaptive Fault-Tolerant Routing Algorithm for Hypercube Multicomputers
IEEE Transactions on Parallel and Distributed Systems
Broadcasting on the star and pancake interconnection networks
IPPS '95 Proceedings of the 9th International Symposium on Parallel Processing
Designing irregular parallel algorithms with mutual exclusion and lock-free protocols
Journal of Parallel and Distributed Computing
Fast shared-memory algorithms for computing the minimum spanning forest of sparse graphs
Journal of Parallel and Distributed Computing
A study on the locality behavior of minimum spanning tree algorithms
HiPC'06 Proceedings of the 13th international conference on High Performance Computing
Hi-index | 0.00 |
To build a multicasting tree in a multicomputer network, the authors propose three strategies based on voting, constructing a minimum spanning tree, and repeatedly constructing multiple minimum spanning trees. Typically, performance metrics to evaluate a multicast solution include time and traffic. Simultaneously optimizing both metrics is computationally intractable because the problem is NP-complete. The first scheme always guarantees the use of the shortest path from the source node to each destination, which makes it time-optimal. The other two schemes do not guarantee this but try to reduce the traffic as much as possible. To demonstrate these strategies' effectiveness, the authors apply them to hypercubes, star graphs, and star graphs with some faults. They report experimental results to evaluate the performance of these solutions.