The Community for Technology Leaders
Proceedings of IEEE 24th International Symposium on Fault- Tolerant Computing (1994)
Austin, TX, USA
June 15, 1994 to June 17, 1994
ISBN: 0-8186-5520-8
pp: 382-391
Ge-Ming Chiu , Dept. of Electr. Eng. & Technol., Nat. Taiwan Inst. of Technol., Taipei, Taiwan
Shui-Pao Wu , Dept. of Electr. Eng. & Technol., Nat. Taiwan Inst. of Technol., Taipei, Taiwan
ABSTRACT
We investigate fault-tolerant routing which aims at finding feasible minimal paths in a faulty hypercube. The concept of an unsafe node is adopted to identify nodes that may cause routing difficulties. We propose a set of stringent criteria to reduce the number of fault free nodes that are labeled unsafe. Routing efficiency can thus be improved. An algorithm is presented to facilitate the routing of messages. It only requires each node to maintain information about its local state, whereby each node is in one of four states. The issue of deadlock freeness is also addressed. Furthermore, an alternative deadlock-free routing algorithm, which requires a constant of five virtual networks in wormhole routing, is presented.<>
INDEX TERMS
hypercube networks, parallel architectures, fault tolerant computing, reliability, message passing, concurrency control
CITATION

Ge-Ming Chiu and Shui-Pao Wu, "Fault-tolerant routing strategy in hypercube systems," Proceedings of IEEE 24th International Symposium on Fault- Tolerant Computing(FTCS), Austin, TX, USA, 1994, pp. 382-391.
doi:10.1109/FTCS.1994.315622
90 ms
(Ver 3.3 (11022016))