Issue No. 05 - May (1993 vol. 42)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/12.223684
<p>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.</p>
algorithm-based fault tolerance; combinatorial problem; minimal test sets; error detection; multiprocessor systems; divide-and-conquer construction scheme; error detection; fault tolerant computing; multiprocessing systems.
D. Rosenkrantz and S. Ravi, "Improved Bounds for Algorithm-Based Fault Tolerance," in IEEE Transactions on Computers, vol. 42, no. , pp. 630-635, 1993.