Two - Phase Multicast Routing Algorithms forTwo - Dimensional Meshes 1
نویسنده
چکیده
Multicast communication is a signiicant operation in multicomputer systems and can be used to support several other collective communication operations. Hardware implementation is a viable solution to develop a low latency multicast algorithm. In this paper, we present a new multicast routing algorithm for two-dimensional meshes. The algorithm uses wormhole routing mechanism and can send messages to any number of destinations within two start-up communication phases; hence the name, two-phase multicast (TPM) algorithm. The algorithm uses the base routing scheme employed for unicast communication , thereby minimizing the requirement of additional hardware support. The algorithm allows some intermediate nodes that are not in the destination set to perform multicast functions. This feature provides exibility in multicast path selection and therefore improves the performance. We have proposed both deterministic as well as adaptive TPM routing algorithms. A simulation study has been conducted to investigate the performance of the purposed TPM algorithm. The simulation results show that the proposed TPM algorithms perform signiicantly better for both contention-free and mixed-traac conditions, when compared with the previously proposed multicast routing algorithms.
منابع مشابه
A Low Latency Hardware Multicast Routing Algorithm for Two-Dimensional Meshes
Multicast communication is a signi cant operation in multicomputer systems and can be used to support several other collective communication operations. Hardware implementation is a viable solution to develop a low latency multicast algorithm. In this paper, we present a new multicast routing algorithm for two-dimensional meshes. The algorithm uses wormhole routing mechanism and can send messag...
متن کاملA hardware multicast routing algorithm for two-dimensional meshes
Multicast communication is a signiicant operation in multicomputer systems and can be used to support several other collective communication operations. Hardware implementation is a viable solution to develop a low latency multicast algorithm. In this paper , we present a new multicast routing algorithm for two-dimensional meshes. The algorithm uses worm-hole routing mechanism and can send mess...
متن کاملA Fault-Tolerant Deadlock-Free Multicast Algorithm for Wormhole Routed Hypercubes
In this paper, we propose a novel fault-tolerant multicast algorithm for n-dimensional wormhole routed hypercubes. The multicast algorithm will remain functional if the number of faulty nodes in an n-dimensional hypercube is less than n. Multicast is the delivery of the same message from one source node to an arbitrary number of destination nodes. Recently, wormhole routing has become one of th...
متن کاملMulticast computer network routing using genetic algorithm and ant colony
Due to the growth and development of computer networks, the importance of the routing topic has been increased. The importance of the use of multicast networks is not negligible nowadays. Many of multimedia programs need to use a communication link to send a packet from a sender to several receivers. To support such programs, there is a need to make an optimal multicast tree to indicate the opt...
متن کاملPermutation Routing and Sorting on Meshes with Row and Column Buses
We study the problems of permutation routing and sorting on several models of meshes with xed and reconngurable row and column buses. We describe two fast and fairly simple deterministic algorithms for permutation routing on two-dimensional networks, and a more complicated algorithm for multi-dimensional networks. The algorithms are obtained by converting two known oo-line routing schemes into ...
متن کامل