The Community for Technology Leaders
Green Image
Issue No. 04 - April (2006 vol. 55)
ISSN: 0018-9340
pp: 400-415
Antonio Robles , IEEE Computer Society
Pedro L?pez , IEEE Computer Society
Jose Duato , IEEE
Olav Lysne , IEEE
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.
Fault tolerance, direct networks, adaptive routing, virtual channels, bubble flow control.
Antonio Robles, Nils Agne Nordbotten, Pedro L?pez, Tor Skeie, Jose Duato, Jos? Flich, Olav Lysne, Mar?a Engracia G?mez, "A Routing Methodology for Achieving Fault Tolerance in Direct Networks", IEEE Transactions on Computers, vol. 55, no. , pp. 400-415, April 2006, doi:10.1109/TC.2006.46
90 ms
(Ver 3.3 (11022016))