Path-based multicasting in multicomputers

Authors:
H. Harutyunyan;S. Wang
Affiliations:
Department of Computer Science, Concordia University, Montreal, Canada;Department of Computer Science, Concordia University, Montreal, Canada
Venue:
PDCN'07 Proceedings of the 25th conference on Proceedings of the 25th IASTED International Multi-Conference: parallel and distributed computing and networks
Year:
2007

Citing 8
Cited 0

Deadlock-free multicast wormhole routing in multicomputer networks

ISCA '91 Proceedings of the 18th annual international symposium on Computer architecture
Unicast-Based Multicast Communication in Wormhole-Routed Networks

IEEE Transactions on Parallel and Distributed Systems
Wormhole routing techniques for directly connected multicomputer systems

ACM Computing Surveys (CSUR)
A Survey of Wormhole Routing Techniques in Direct Networks

Computer
Multicast Communication in Multicomputer Networks

IEEE Transactions on Parallel and Distributed Systems
Optimal Multicast Communication in Wormhole-Routed Torus Networks

IEEE Transactions on Parallel and Distributed Systems
Turn grouping for efficient multicast in wormhole mesh networks

FRONTIERS '96 Proceedings of the 6th Symposium on the Frontiers of Massively Parallel Computation
An Efficient Path-Based Multicast Algorithm for Mesh Networks

IPDPS '03 Proceedings of the 17th International Symposium on Parallel and Distributed Processing

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we present a path-based multicast routing algorithm for wormhole routed 2D mesh network. Next we present some properties and the time complexity of the new algorithm. Analysis of the algorithm shows that it significantly reduces the multicast time (by about 50% in 2D mesh) and slightly decreases (by 15% in 2D mesh) the multicast traffic over LIN's Hamiltonian path-based algorithm.