A well conditioned checksum scheme for algorithmic fault tolerance

Daniel L. Boley, Franklin T.Luk

Research output: Contribution to journalArticlepeer-review

6 Scopus citations


The weighted checksum scheme has been proposed as a low-cost fault tolerant procedure for parallel matrix computations. To guarantee multiple error detection and correction, the chosen weight vectors must satisfy some very specific properties about linear independence. However, previous weight generating methods that fulfill the independence criteria have troubles with numerical overflow. We will present a new scheme that generates weight vectors via Chebyshev polynomials to meet the requirements about independence and to avoid the difficulties with overflow.

Original languageEnglish (US)
Pages (from-to)21-32
Number of pages12
JournalIntegration, the VLSI Journal
Issue number1
StatePublished - Nov 1991

Bibliographical note

Funding Information:
The authors acknowledge their research sponsors: D.L. Boley was supported in part by the National Science Foundation under grant CCR-8813493, and F.T. Luk by the Joint Services Electronics Program under contract F49620-90-C-0039.


  • Algorithm-based fault tolerance
  • Berlekamp-Massey algorithm
  • Chebyshev polynomials
  • Lanczos algorithm


Dive into the research topics of 'A well conditioned checksum scheme for algorithmic fault tolerance'. Together they form a unique fingerprint.

Cite this