A routing methodology for achieving fault tolerance in direct networks
Authors:
- N.A. NordbottenNNN.A. Nordbotten
- J. FlichJFJ. Flich
- P. LopezPLP. Lopez
- T. SkeieTST. Skeie
- 20 March 2006
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computers
- Vol. 55 (4) , 400-415
Abstract
Massively parallel computing systems are being built with thousands of nodes. The interconnection network plays a key role for the performance of such systems. However, the high number of components significantly increases the probability of failure. Additionally, failures in the interconnection network may isolate a large fraction of the machine. It is therefore critical to provide an efficient fault-tolerant mechanism to keep the system running, even in the presence of faults. This paper presents a new fault-tolerant routing methodology that does not degrade performance in the absence of faults and tolerates a reasonably large number of faults without disabling any healthy node. In order to avoid faults, for some source-destination pairs, packets are first sent to an intermediate node and then from this node to the destination node. Fully adaptive routing is used along both subpaths. The methodology assumes a static fault model and the use of a checkpoint/restart mechanism. However, there are scenarios where the faults cannot be avoided solely by using an intermediate node. Thus, we also provide some extensions to the methodology. Specifically, we propose disabling adaptive routing and/or using misrouting on a per-packet basis. We also propose the use of more than one intermediate node for some paths. The proposed fault-tolerant routing methodology is extensively evaluated in terms of fault tolerance, complexity, and performance.Keywords
This publication has 45 references indexed in Scilit:
- A low cost fault tolerant packet routing for parallel computers2004
- ImmunetACM SIGARCH Computer Architecture News, 2004
- A theory of fault-tolerant routing in wormhole networks2002
- A Flexible Routing Scheme for Networks of Workstations2000
- Reliable unicasting in faulty hypercubes using safety levelsIEEE Transactions on Computers, 1997
- A necessary and sufficient condition for deadlock-free routing in cut-through and store-and-forward networksIEEE Transactions on Parallel and Distributed Systems, 1996
- Configurable flow control mechanisms for fault-tolerant routingACM SIGARCH Computer Architecture News, 1995
- Deadlock-free adaptive routing in multicomputer networks using virtual channelsIEEE Transactions on Parallel and Distributed Systems, 1993
- Virtual-channel flow controlIEEE Transactions on Parallel and Distributed Systems, 1992
- A Scheme for Fast Parallel CommunicationSIAM Journal on Computing, 1982