Adaptive Path-Based Multicast on Wormhole-Routed Hypercubes

Abstract

In this paper, we consider the problem of path-based multicasting on wormhole-routed hypercubes. A minimum set of routing restrictions based on the strategy proposed by Li[4] is used for both unicast and multicast. To correctly perform multicast operations. we proposed the natural list approach to order the destination nodes. The proposed approach can be proved to be deadlock-free for both one-port and multi-port systems. Furthermore, it creates only one worm for each multicast operation, and provides adaptive shortest paths between each pair of nodes in the multicast path. The potential adaptively provided by the proposed approach is superior to previous works. Between each pair of nodes in the multicast path with distance k, on the average, there are at least (k+1)/1/2k paths. Unicast and broadcast can be treated as degenerated cases and use the same routing algorithm. Therefore, the proposed algorithm offers a comprehensive routing solution for communication on hypercubes.