A FAULT-TOLERANT OPTIMAL MESSAGE ROUTING METHODOLOGY FOR CUBE-CONNECTED-CYCLES PARALLEL COMPUTERS

摘要

A cube-connected-cycles (CCC) is a regular graph, suitable for constructing the interconnection network of parallel or multi-node computer systems. The CCC network possesses the features of symmetry, regularity, fault tolerance, and fixed degree of the network. Message delivery through an interconnection network sometimes fails due to processing node and/or link faults or simply because some processors are too busy to handle message transfer. To make a CCC-based parallel computer more resilient to node/link faults, this paper proposes an optimal routing method that guarantees to find a shortest path between the source and the destination nodes within a faulty CCC-based network if such a path exists. The proposed method is based on the concepts of radiation and backtracking and is able to find the shortest path with little impact on the network traffic load. The time complexity of our routing methodology is O(log N), where N is the number of nodes in the CCC architecture.