By Topic

Fault-tolerant computing on trees

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Agrawal, A. ; Dept. of Comput. Sci., Brown Univ., Providence, RI, USA

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

Published in:

Parallel and Distributed Processing, 1990. Proceedings of the Second IEEE Symposium on

Date of Conference:

9-13 Dec 1990