Optimal routing and multicasting in wormhole-routed honeycomb networks

The authors first present a deadlock-free routing algorithm in honeycomb networks. Based on the routing algorithm, we develop a minimum-time multicast algorithm in one-port wormhole-routed honeycomb meshes, in the absence of hardware multicast support. By exploiting the properties of the switching technology and the use of virtual channels, the algorithm can deliver a multicast message to m-1 destinations in [log/sub 2/ m] message-passing steps, while avoiding contention among the constituent unicast messages.