Scheduled System Maintenance:
Some services will be unavailable Sunday, March 29th through Monday, March 30th. We apologize for the inconvenience.
By Topic

Exploiting data flow information in algorithm-based fault tolerance

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

3 Author(s)
Shamsunder, R. ; Dept. of Comput. Sci., Albany Univ., NY, USA ; Rosenkrantz, D.J. ; Ravi, S.S.

The authors examine the use of data flow information in algorithm-based fault tolerance for multiprocessor computations. They show that this information can lead to a more efficient design, by reducing the number of checks. They investigate both the analysis problem of determining the fault tolerance measures of a given system, and the design problem of constructing compact check sets to detect or locate a given number of faults. Specifically, it is shown that the analysis problem can be solved efficiently when the number of faults is fixed. The computational difficulty of this problem when the number of faults is not fixed is addressed. The authors consider the design problem for special classes of data flow graphs and establish upper and lower bounds on the number of checks needed to detect or locate a given number of faults.

Published in:

Fault-Tolerant Computing, 1993. FTCS-23. Digest of Papers., The Twenty-Third International Symposium on

Date of Conference:

22-24 June 1993