Path-based Multicasting in Multicomputers

H. Harutyunyan and S. Wang (Canada)


Multicumputers, multicasting, path-based multicasting, algorithm, simulation


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.

Important Links:

Go Back