This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Improved Bounds for Algorithm-Based Fault Tolerance
May 1993 (vol. 42 no. 5)
pp. 630-635

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.

[1] P. Banerjee, "A theory for algorithm-based fault tolerance in array processor systems," (Ph.D. dissertation) Rep. CSG-39, Coordinated Sci. Lab., Univ. Illinois at Urbana-Champaign, Dec. 1984.
[2] P. Banerjee and J. A. Abraham, "Fault-secure algorithms for multiple processor systems," inProc. 11th Int. Symp. Comput. Architecture, June 1984, pp. 279-287.
[3] P. Banerjee and J. A. Abraham, "Bounds on algorithm-based fault tolerance in multiple processor systems,"IEEE Trans. Comput., vol. C-35, pp. 296-306, Apr. 1986.
[4] P. Banerjee and J. A. Abraham, "Concurrent fault diagnosis in multiple processor systems," inProc. 16th Int. Symp. Fault Tolerant Comput., (FTCS-16), Vienna, Austria, July 1986, pp. 298-303.
[5] D. C. Gu, "Design and analysis of fault tolerance schemes for multiprocessor systems," Ph.D. dissertation, Dep. Comput. Sci., Univ. Albany-S.U.N.Y., Nov. 1991.
[6] D. Gu, J. Rosenkrantz, and S. S. Ravi, "Design and analysis of test schemes for algorithm-based fault tolerance," inProc. 20th Int. Symp. Fault-Tolerant Comput., Newcastle, England, June 26-28, 1990, pp. 106-113.
[7] D. C. Gu, D. J. Rosenkrantz, and S. S. Ravi, "New test schemes for algorithm-based fault tolerance," Tech. Rep. 90-24, Dep. Comput. Sci., Univ. at Albany-S.U.N.Y., Nov. 1990, submitted for publication.
[8] K. H. Huang and J. A. Abraham, "Algorithm-based fault tolerance for matrix operations,"IEEE Trans. Comput., vol. C-33, no. 6, pp. 518-528, June 1984.
[9] F. T. Luk and H. Park, "Analysis of algorithm-based fault tolerance techniques," inJ. Parallel Distribut. Comput., vol. 5, pp. 172-184, 1988.
[10] V. S. S. Nair, "Analysis and design of algorithm-based fault-tolerant systems," Ph.D. dissertation, Univ. of Illinois, Urbana, IL, 1990.
[11] V. S. S. Nair and J. A. Abraham, "Hierarchical design and analysis of fault-tolerant multiprocessor systems using concurrent error detection," inProc. 20th Int. Symp. Fault-Tolerant Comput., (FTCS-20), Newcastle upon Tyne, June 1990, pp. 130-137.
[12] D. J. Rosenkrantz and S. S. Ravi, "Improved bounds for algorithm-based fault tolerance," Tech. Rep. 88-22, Dep. Comput. Sci., University at Albany-S.U.N.Y., Aug. 1988.
[13] R. K. Sitaraman and N. K. Jha, "Optimal design of checks for error detection and location in fault-tolerant multiprocessor systems," inProc. 5th Int. Conf. Fault-Tolerant Comput. Syst., Nurnberg, Germany, Sept. 1991.

Index Terms:
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.
Citation:
D.J. Rosenkrantz, S.S. Ravi, "Improved Bounds for Algorithm-Based Fault Tolerance," IEEE Transactions on Computers, vol. 42, no. 5, pp. 630-635, May 1993, doi:10.1109/12.223684
Usage of this product signifies your acceptance of the Terms of Use.