DocumentCode
3032566
Title
Overview of fault handling for the chaos router
Author
Bolding, Kevin ; Snyder, Lawrence
Author_Institution
Washington Univ., Seattle, WA, USA
fYear
1991
fDate
18-20 Nov 1991
Firstpage
124
Lastpage
127
Abstract
The chaos router is an adaptive nonminimal message router for multicomputers that is simple enough to compete with the fast, oblivious routers now in use in commercial machines. It improves on previous adaptive routers by using randomization, which eliminates the need for complex livelock protection and speeds the router. This randomization, however, greatly complicates the fault detection because there is no worstcase bound on the time required to deliver a message. Distinguishing between lost and very slow messages is difficult. A new method of fault detection is presented that applies not only to the chaos router but also to other adaptive routers as well. In addition, solutions to several practical fault diagnosis and recovery problems in the chaos router are presented. The presentation supports the claim that fault tolerance can be incorporated into a practical router without harming performance for the normal, fault-free cases
Keywords
fault tolerant computing; multiprocessor interconnection networks; adaptive nonminimal message router; chaos router; fault detection; fault diagnosis; fault handling; fault tolerance; multicomputers; overview; randomization; recovery problems; Bidirectional control; Chaos; Chaotic communication; Fault detection; Fault diagnosis; Fault tolerance; Hypercubes; Routing; System recovery; Upper bound;
fLanguage
English
Publisher
ieee
Conference_Titel
Defect and Fault Tolerance on VLSI Systems, 1991. Proceedings., 1991 International Workshop on
Conference_Location
Hidden Valley, PA
ISSN
1550-5774
Print_ISBN
0-8186-2457-4
Type
conf
DOI
10.1109/DFTVS.1991.199953
Filename
199953
Link To Document