Efficient Heuristics for All-Port Multicast in Wormhole-Routed Hypercubes

Authors:
Vivek Halwan;Füsun Özgüner
Affiliations:
United Technologies Research Center, East Hartford, CT;Ohio State Univ., Columbus, OH
Venue:
IEEE Transactions on Parallel and Distributed Systems
Year:
2000

Citing 7
Cited 4

Efficient collective data distribution in all-port wormhole-routed hypercubes

Proceedings of the 1993 ACM/IEEE 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
All-to-All Personalized Communication in a Wormhole-Routed Torus

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 Survey of Wormhole Routing Techniques in Direct Networks

Computer
Multicast Communication in Multicomputer Networks

IEEE Transactions on Parallel and Distributed Systems

Broadcasting in all-output-port meshes of trees with distance-insensitive switching

Journal of Parallel and Distributed Computing
Fault-tolerant routing and multicasting in hypercubes using a partial path set-up

Parallel Computing
Unicast-based fault-tolerant multicasting in wormhole-routed hypercubes

Journal of Systems Architecture: the EUROMICRO Journal
Fault-tolerant routing and multicasting in hypercubes using a partial path set-up

Parallel Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper presents several recursive heuristic methods for multicasting in all-port dimension-ordered wormhole-routed hypercubes. The methods described are stepwise contention-free and are primarily designed to reduce the number of communication steps required to complete the multicast operation. Comparisons show that the number of steps can be significantly reduced compared to depth contention-free solutions previously described. These methods are also shown to be source-controlled depth contention-free and can be considered a generalization of the broadcast method described in [1], which is the most efficient method known.