DocumentCode :
3349178
Title :
Fault tolerance of adaptive routing algorithms in multicomputers
Author :
Reddy, A. L Narasimha ; Freitas, Rich
Author_Institution :
IBM Almaden Res. Center, San Jose, CA, USA
fYear :
1992
fDate :
1-4 Dec 1992
Firstpage :
156
Lastpage :
161
Abstract :
An evaluation of the effectiveness of adaptive routing techniques in tolerating failures is presented. It is shown that adaptive routing techniques yield gracefully degradable systems for the workloads considered. For medium to large communication granularity and the workloads considered in this study, if adaptive-routing is used, it is shown that the problem completion time does not increase drastically due to failures. When node failures were considered, it was observed that the mismatch of problem communication structure with the physical communication structure did not result in significant loss of performance. Since adaptive routing techniques are warranted for performance reasons, it is argued that making use of this adaptive routing hardware to tolerate failures is a favorable option
Keywords :
fault tolerant computing; multiprocessing systems; performance evaluation; adaptive routing algorithms; communication granularity; fault tolerance; gracefully degradable systems; multicomputers; node failures; physical communication structure; problem communication structure; Cyclic redundancy check; Degradation; Distributed computing; Fault tolerance; Fault tolerant systems; Hypercubes; Proposals; Protection; Routing; Topology;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Parallel and Distributed Processing, 1992. Proceedings of the Fourth IEEE Symposium on
Conference_Location :
Arlington, TX
Print_ISBN :
0-8186-3200-3
Type :
conf
DOI :
10.1109/SPDP.1992.242750
Filename :
242750
Link To Document :
بازگشت