透過您的圖書館登入
IP:3.15.225.173
  • 期刊

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.

參考文獻


Dandamudi, S. P., Hierarchical Hypercube Multicomputer Interconnection Networks, Ellis Horwood (1991).
Fang, J.-F., Lee, C.-M., Yen, E.-Y., Chen, R.-X., and Feng, Y.-C., “Novel broadcasting schemes on cube-connected cycles,” IEEE Pacific Rim Conference on Communications, Computers and Signal Processing, pp.629-632 (2005).
Gaughan, P. T. and Yalamanchili, S., “Adaptive routing protocols for hypercube interconnection networks,” IEEE Computer, Vol. 26, No. 5, pp. 12-23 (1993).
Hwang, K., Advanced Computer Architecture; Parallelism, Scalability, Programmability, McGraw-Hill (1993).
Jang, J. E., “An optimal fault-tolerant broadcasting algorithm for a cube-connected cycles multiprocessor,” International Conference on Databases, Parallel Architectures and Their Application, pp. 206-215 (1990).

延伸閱讀