A Performance Study of Path Based Multicast Communication Algorithms
- 24 October 2006
- conference paper
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 245-250
- https://doi.org/10.1109/parelec.2006.7
Abstract
Multicast communication's history has been driven by many schemes; however, a few have shown their efficiency on interconnection networks. Among these schemes, path based multicast has been proven to be more efficient in handling multicast, than those classified either as unicast based or tree-based schemes. This paper, therefore, focuses on path based scheme, examining some well-known path-based algorithms. Many experiments have been conducted to evaluate these algorithms in various operating scenarios and traffic conditions. The relative strengths, weaknesses and applicability of each algorithm to diverse situations are discussed. Our results have shown the superiority of our proposed QG algorithms against some of the well know multicast algorithmsKeywords
This publication has 16 references indexed in Scilit:
- Optimal all-ports collective communication algorithms for the k-ary n-cube interconnection networksJournal of Systems Architecture, 2004
- A hardware multicast routing algorithm for two-dimensional meshesPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- A new adaptive hardware tree-based multicast routing in k-ary n-cubesIEEE Transactions on Computers, 2001
- Balancing Traffic Load for Multi-Node Multicast in a Wormhole 2-D Torus/MeshThe Computer Journal, 2001
- An efficient implementation of tree-based multicast routing for distributed shared-memory multiprocessorsJournal of Systems Architecture, 2000
- Time-Step Optimal Broadcasting in 3-D Meshes with Minimum Total Communication DistanceJournal of Parallel and Distributed Computing, 2000
- Turn Grouping for Multicast in Wormhole-Routed Mesh Networks Supporting the Turn ModelThe Journal of Supercomputing, 2000
- Multidestination message passing in wormhole k-ary n-cube networks with base routing conformed pathsIEEE Transactions on Parallel and Distributed Systems, 1999
- Resource deadlocks and performance of wormhole multicast routing algorithmsIEEE Transactions on Parallel and Distributed Systems, 1998
- Deadlock-free multicast wormhole routing in 2-D mesh multicomputersIEEE Transactions on Parallel and Distributed Systems, 1994