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.

[1]  Sudhakar Yalamanchili,et al.  Interconnection Networks: An Engineering Approach , 2002 .

[2]  Jai Eun Jang.  An optimal fault-tolerant broadcasting algorithm for a cube-connected cycles multiprocessor , 1990, Proceedings. PARBASE-90: International Conference on Databases, Parallel Architectures, and Their Applications.

[3]  Abdou Youssef,et al.  Interconnection Networks for High-Performance Parallel Computers , 1994 .

[4]  宋建平,et al.  An Optimal Multicast Algorithm for Cube-Connected Cycles , 2000 .

[5]  Junjie Wu,et al.  Advanced Computer Architecture , 2014, Communications in Computer and Information Science.

[6]  Cheng-Kuan Lin,et al.  Graph Theory and Interconnection Networks , 2008 .

[7]  Sivarama P. Dandamudi,et al.  Hierarchical hypercube multicomputer interconnection networks , 1991 .

[8]  Jywe-Fei Fang,et al.  Novel broadcasting schemes on cube-connected cycles , 2005, PACRIM. 2005 IEEE Pacific Rim Conference on Communications, Computers and signal Processing, 2005..

[9]  C. Y. Roger Chen,et al.  Optimal Routing Algorithm and the Diameter of the Cube-Connected Cycles , 1993, IEEE Trans. Parallel Distributed Syst..

[10]  Chuan-lin Wu,et al.  Tutorial, interconnection networks for parallel and distributed processing , 1984 .

[11]  Junming Xu.  Topological Structure and Analysis of Interconnection Networks , 2002, Network Theory and Applications.

[12]  Franco P. Preparata,et al.  The cube-connected-cycles: A versatile network for parallel computation , 1979, 20th Annual Symposium on Foundations of Computer Science (sfcs 1979).

[13]  Kai Hwang,et al.  Advanced computer architecture - parallelism, scalability, programmability , 1992 .

[14]  Behrooz Parhami.  Introduction to Parallel Processing , 2002, Series in Computer Science.

[15]  Behrooz Parhami,et al.  Introduction to Parallel Processing: Algorithms and Architectures , 1999 .

[16]  Sudhakar Yalamanchili,et al.  Adaptive routing protocols for hypercube interconnection networks , 1993, Computer.

[17]  F. Leighton,et al.  Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes , 1991 .

[18]  Albert Y. Zomaya.  Parallel and Distributed Computing Handbook , 1995 .

[19]  Sajal K. Das,et al.  Book Review: Introduction to Parallel Algorithms and Architectures : Arrays, Trees, Hypercubes by F. T. Leighton (Morgan Kauffman Pub, 1992) , 1992, SIGA.