Title :
Fault-tolerant computing on trees
Author_Institution :
Dept. of Comput. Sci., Brown Univ., Providence, RI, USA
Abstract :
The paper analyzes the fault-tolerance of complete binary tree networks. It shows how an N-mode tree subject to random failures can simulate a perfect, fault-free tree under different fault models. If edges fail with independent probability p<1 /3 it shows both a lower bound and an approximately tight upper bound on the time required to simulate a perfect tree on the faulty tree. If edges are assumed to be robust and the nodes have a failure probability of p<1/2, then the faulty tree can simulate the fault-free tree with O(loglogN) slowdown. The paper also shows a matching lower bound for using all non-faulty processors. These results are combined to analyse other fault models. All the results hold with high probability
Keywords :
fault tolerant computing; multiprocessor interconnection networks; parallel algorithms; trees (mathematics); approximately tight upper bound; complete binary tree networks; edges; failure probability; fault models; fault-free tree; fault-tolerance; faulty tree; independent probability; lower bound; perfect tree; random failures; Computational modeling; Fabrication; Failure analysis; Fault tolerance; Hypercubes; Network-on-a-chip; Robustness; Semiconductor device modeling; Upper bound; Wafer scale integration;
Conference_Titel :
Parallel and Distributed Processing, 1990. Proceedings of the Second IEEE Symposium on
Conference_Location :
Dallas, TX
Print_ISBN :
0-8186-2087-0
DOI :
10.1109/SPDP.1990.143631
