A well conditioned checksum scheme for algorithmic fault tolerance

Daniel L. Boley; Franklin T.Luk

doi:10.1016/0167-9260(91)90040-R

A well conditioned checksum scheme for algorithmic fault tolerance

Daniel L. Boley, Franklin T.Luk

Computer Science and Engineering

Research output: Contribution to journal › Article › peer-review

6 Scopus citations

Abstract

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 language	English (US)
Pages (from-to)	21-32
Number of pages	12
Journal	Integration, the VLSI Journal
Volume	12
Issue number	1
DOIs	https://doi.org/10.1016/0167-9260(91)90040-R
State	Published - 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.

Keywords

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

Publisher link

10.1016/0167-9260(91)90040-R

Find It

Find It at U of M Libraries

Cite this

@article{d727eedec9384d46a399886b9d3db6a7,

title = "A well conditioned checksum scheme for algorithmic fault tolerance",

abstract = "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.",

keywords = "Algorithm-based fault tolerance, Berlekamp-Massey algorithm, Chebyshev polynomials, Lanczos algorithm",

author = "Boley, {Daniel L.} and Franklin T.Luk",

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.",

year = "1991",

month = nov,

doi = "10.1016/0167-9260(91)90040-R",

language = "English (US)",

volume = "12",

pages = "21--32",

journal = "Integration, the VLSI Journal",

issn = "0167-9260",

publisher = "Elsevier",

number = "1",

}

TY - JOUR

T1 - A well conditioned checksum scheme for algorithmic fault tolerance

AU - Boley, Daniel L.

AU - T.Luk, Franklin

N1 - 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.

PY - 1991/11

Y1 - 1991/11

N2 - 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.

AB - 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.

KW - Algorithm-based fault tolerance

KW - Berlekamp-Massey algorithm

KW - Chebyshev polynomials

KW - Lanczos algorithm

UR - http://www.scopus.com/inward/record.url?scp=0026256155&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0026256155&partnerID=8YFLogxK

U2 - 10.1016/0167-9260(91)90040-R

DO - 10.1016/0167-9260(91)90040-R

M3 - Article

AN - SCOPUS:0026256155

SN - 0167-9260

VL - 12

SP - 21

EP - 32

JO - Integration, the VLSI Journal

JF - Integration, the VLSI Journal

IS - 1

ER -

A well conditioned checksum scheme for algorithmic fault tolerance

Abstract

Bibliographical note

Keywords

Publisher link

Find It

Other files and links

Fingerprint

Cite this