Path-based multicast communication in wormhole-routed unidirectional torus networks
Journal of Parallel and Distributed Computing
Resource Deadlocks and Performance of Wormhole Multicast Routing Algorithms
IEEE Transactions on Parallel and Distributed Systems
Strategies for path-based multicasting in wormhole-routed meshes
Journal of Parallel and Distributed Computing
Efficient Broadcasting in Wormhole-Routed Multicomputers: A Network-Partitioning Approach
IEEE Transactions on Parallel and Distributed Systems
A New Adaptive Hardware Tree-Based Multicast Routing in K-Ary N-Cubes
IEEE Transactions on Computers
Interconnection Networks: An Engineering Approach
Interconnection Networks: An Engineering Approach
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
A Hardware Multicast Routing Algorithm for Two-Dimensional Meshes
SPDP '96 Proceedings of the 8th IEEE Symposium on Parallel and Distributed Processing (SPDP '96)
An Efficient Path-Based Multicast Algorithm for Mesh Networks
IPDPS '03 Proceedings of the 17th International Symposium on Parallel and Distributed Processing
Optimal all-ports collective communication algorithms for the k-ary n-cube interconnection networks
Journal of Systems Architecture: the EUROMICRO Journal
Journal of Systems Architecture: the EUROMICRO Journal
Multicast communication in wormhole-routed symmetric networks with hamiltonian cycle model
Journal of Systems Architecture: the EUROMICRO Journal
A survey of research and practices of Network-on-chip
ACM Computing Surveys (CSUR)
Hi-index | 0.00 |
This paper addresses the issue of multicast communication in scalable interconnection networks, using path-based scheme. Most existing multicast algorithms either assume a fixed network size, low dimensional networks or only consider the latency at the network level. As a consequence, most of these algorithms implement multicast in a sequential manner and can not scale well with the network dimensions or the number of nodes involved. Furthermore, most of these algorithms handle multicast communication with low throughput. In this paper, we propose a multicast algorithm for multidimensional interconnection networks, which is built upon our Qualified Groups QG multicast scheme for ensuring efficient communication irrespective of the network sizes/dimensions or the number of the destination nodes. Unlike the existing works, this study considers the scalability and latency at both the network and node levels so as to achieve a high degree of parallelism. Our results show that the proposed algorithm considerably improves the multicast message delivery ratio, throughput and scalability.