Combinatorial Analysis of Check Set Construction for Algorithm-Based Fault Tolerance Systems

Authors:
De-Qiang Wang;Lian-Chang Zhao
Affiliations:
Department of Basic Sciences, Dalian Maritime University, Dalian 116026, P.R. China;Department of Basic Sciences, Dalian Maritime University, Dalian 116026, P.R. China
Venue:
Journal of Electronic Testing: Theory and Applications
Year:
1998

Citing 4
Cited 0

Bounds on Algorithm-Based Fault Tolerance in Multiple Processor Systems

IEEE Transactions on Computers - The MIT Press scientific computation series
Concrete mathematics: a foundation for computer science

Concrete mathematics: a foundation for computer science
Improved Bounds for Algorithm-Based Fault Tolerance

IEEE Transactions on Computers
Construction of Check Sets for Algorithm-Based Fault Tolerance

IEEE Transactions on Computers

Quantified Score

Hi-index	0.00

Visualization

Abstract

Algorithm-based fault tolerance (ABFT) is a low-cost system-levelconcurrent error detection and fault location scheme. The design problemfor an ABFT system is concerned with the construction of a check set fordetecting errors or faults. In this paper, we analyze the construction ofcheck sets from a combinatorial perspective, and propose a necessary andsufficient condition for the design of a check set that detects a givennumber of errors. We also propose a new bound for detecting three errorsfor algorithm-based fault tolerance systems.