Issue No. 02 - February (1996 vol. 45)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/12.485376
<p><b>Abstract</b>-Algorithm-based techniques are based on checking for the preservation of certain properties possessed by global data following a set of computations. This often involves the introduction of a check variable which is updated in such a manner that, in the absence of roundoff errors, it equals the value of some function which involves all the data elements participating in the algorithm. However, the fact that roundoff errors accumulate in different ways in the updates involving the check variables and the computations involving data elements make it highly unlikely that the equality is preserved exactly for an implementation of the algorithm on a real computer. Thus, the check step involves verifying the preservation of the equality to within a tolerance value. In this brief contribution, we propose a method for determination of the tolerance based on error analysis techniques. We present results on three numerical algorithms which show the effectiveness of our approach for data sets of varying sizes and data ranges.</p>
Parallel algorithms, algorithm-based fault-tolerance, checksum encodings, check thresholding, roundoff error analysis.
P. Banerjee and A. Chowdhury, "A New Error Analysis Based Method for Tolerance Computation for Algorithm-Based Checks," in IEEE Transactions on Computers, vol. 45, no. , pp. 238-243, 1996.