Title :
Improved bounds for algorithm-based fault tolerance
Author :
Rosenkrantz, Daniel J. ; Ravi, S.S.
Author_Institution :
Dept. of Comput. Sci., State Univ. of New York, Albany, NY, USA
fDate :
5/1/1993 12:00:00 AM
Abstract :
Lower and upper bounds are established for the combinatorial problem of constructing minimal test sets for error detection in multiprocessor systems. The construction for detecting two errors produces minimal test sets, while that for three errors produces test sets whose size exceeds the lower bound by at most one. Also presented is a divide-and-conquer construction scheme for four or more errors
Keywords :
error detection; fault tolerant computing; multiprocessing systems; algorithm-based fault tolerance; combinatorial problem; divide-and-conquer construction scheme; error detection; minimal test sets; multiprocessor systems; Communication system control; Computer errors; Computer science; Fault detection; Fault tolerance; Fault tolerant systems; Multiprocessing systems; System testing; Upper bound;
Journal_Title :
Computers, IEEE Transactions on
