Abstract
Algorithm-based fault tolerance (ABFT) is a low-cost system-level concurrent error detection and fault location scheme. The design problem for an ABFT system is concerned with the construction of a check set for detecting errors or faults. In this paper, we analyze the construction of check sets from a combinatorial perspective, and propose a necessary and sufficient condition for the design of a check set that detects a given number of errors. We also propose a new bound for detecting three errors for algorithm-based fault tolerance systems.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
K.H. Huang and J.A. Abraham, “Algorithm-Based Fault Tolerance for Matrix Operation,” IEEE Trans. Comput., Vol. 33, No. 6, pp. 518–528, 1984.
P. Banerjee and J.A. Abraham, “Bounds on Algorithm-Based Fault Tolerance in Multiple Processor Systems,” IEEE Trans. Comput., Vol. 35, No. 4, pp. 296–306, 1986.
P. Banerjee and J.A. Abraham, “Concurrent Fault Diagnosis in Multiple Processor Systems,” Proc. 16th Int. Symp.Fault Tolerant Comput., 1984, No. 6, pp. 518–528.
D. Gu, D.J. Rosenkrantz, and S.S. Ravi, “Construction of Check Sets for Algorithm-Based Fault Tolerance,” IEEE Trans. Comput., Vol. 43, No. 6, pp. 641–650, June 1994.
D.J. Rosenkrantz and S.S. Ravi, “Improved Bounds for Algorithm-Based Fault Tolerance,” IEEE Trans. Comput., Vol. 42, No. 5, pp. 630–635, May 1993.
R.L. Graham, D.E. Knuth, and O. Patashnik, Concrete Mathematics·A Foundation for Computer Science, Addison-Wesley, Reading, Mass. 1989.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Wang, DQ., Zhao, LC. Combinatorial Analysis of Check Set Construction for Algorithm-Based Fault Tolerance Systems. Journal of Electronic Testing 12, 255–260 (1998). https://doi.org/10.1023/A:1008280801768
Issue Date:
DOI: https://doi.org/10.1023/A:1008280801768