Multicast Communication in Wormhole-Routed Star Graph Interconnection Networks

Multicast is an important collective communication op-eration on multicomputer systems, in which the same mes-sage is delivered from a source node to an arbitrary num-ber of destination nodes. The star graph interconnection network has been recognized as an attractive alternative to the popular hypercube network. In this paper, we ad-dress an efficient and deadlock-free tree-based multicast routing scheme for wormhole-routed star graph networks with hamiltonian path. In our proposed routing scheme, the router is with the input-buffer-based asynchronous replica-tion mechanism that requires extra hardware cost. Mean-while, the router simultaneously sends incoming flits on more than one outgoing channel. We perform simulation experiments with the network latency and the network traf-fic. Experimental results demonstrate that our proposed routing scheme outperform the previous approaches