DEADLOCK-FREE WORMHOLE ROUTING ALGORITHMS FOR STAR GRAPH TOPOLOGY

For constructing massively parallel multicomputers with over 5000 proc essing nodes, the Star Graph topology is known to be better than the h ypercube in terms of the average routing distance, the number of links per node, and the fault diameter. The authors present two deadlock-fr ee algorithms for routing in Star Graph, assuming the Wormhole routing model. Both the algorithms use the concept of virtual channels introd uced by Daily and Seitz. The first algorithm is non-optimal in terms o f the average routing distance, but uses fewer virtual channels on the whole. The second algorithm is optimal in terms of routing performanc e, but requires a somewhat larger number of virtual channels per node.