Deadlock-free wormhole routing algorithms for star graph topology

Abstract

For constructing massively parallel multicomputers with over 5000 processing nodes, the star graph topology is known to be better than the hypercube in terms of the average routing distance, the number of links per node, and the fault diameter. The authors present two deadlock-free algorithms for routing in star graph, assuming the wormhole routing model. Both the algorithms use the concept of virtual channels introduced by W. Dally and C.L. Seitz (1987). The first algorithm is non-optimal in terms of the average routing distance, but uses fewer virtual channels on the whole. The second algorithm is optimal in terms of routing performance, but requires a somewhat larger number of virtual channels per node.