Path-based multicast communication in wormhole-routed star graph multicomputers

In this paper, we propose lour efficient multicast routing schemes in wormhole-routed star networks with multidestination routing capability. All of the four proposed schemes are path-based and deadlock-free. The first scheme, dual-path routing, sends the message in parallel through two independent paths. The second one, shortcut-node-based dual-path routing, is similar to dual-path routing except that the routing tries to End a shortcut node to route the message as soon as possible to reduce the length of transmission path. The third one, multipath routing, is a multiple dual-path routing strategy that includes source-to-relay and relay-to-destination phases. The last scheme, proximity grouping routing, is similar to multipath routing except that in the partitioning step of source and destination nodes the relation of spatial locality of nodes is also taken into account to reduce the length of transmission paths. Finally, the Experimental results are given to show that the performance based on unicast-based and traditional hamiltonian-path routing schemes can be improved significantly by the four proposed routing schemes respectively.