Catalogo Articoli (Spogli Riviste)

OPAC HELP

Titolo:
An efficient algorithm-based fault tolerance design using the weighted data-check relationship
Autore:
Youn, HY; Oh, CG; Choo, H; Chung, JW; Lee, D;
Indirizzi:
Sung Kyun Kwan Univ, Sch Elect & Comp Engn, Suwon 440746, South Korea SungKyun Kwan Univ Suwon South Korea 440746 , Suwon 440746, South Korea Nsyst Commun, San Diego, CA 92127 USA Nsyst Commun San Diego CA USA 92127Nsyst Commun, San Diego, CA 92127 USA Informat & Commun Uni, Sch Engn, Taejon, South Korea Informat & Commun Uni Taejon South Korea Sch Engn, Taejon, South Korea
Titolo Testata:
IEEE TRANSACTIONS ON COMPUTERS
fascicolo: 4, volume: 50, anno: 2001,
pagine: 371 - 383
SICI:
0018-9340(200104)50:4<371:AEAFTD>2.0.ZU;2-L
Fonte:
ISI
Lingua:
ENG
Soggetto:
CONCURRENT COMPUTING STRUCTURES; MULTIPROCESSOR SYSTEMS; ERROR-DETECTION; BOUNDS;
Keywords:
algorithm-based fault tolerance; Hamming correcting code; matrix computations; overflow; round-off error; VLSI processor array;
Tipo documento:
Article
Natura:
Periodico
Settore Disciplinare:
Engineering, Computing & Technology
Citazioni:
34
Recensione:
Indirizzi per estratti:
Indirizzo: Youn, HY Sung Kyun Kwan Univ, Sch Elect & Comp Engn, Suwon 440746, South Korea Sung Kyun Kwan Univ Suwon South Korea 440746 40746, South Korea
Citazione:
H.Y. Youn et al., "An efficient algorithm-based fault tolerance design using the weighted data-check relationship", IEEE COMPUT, 50(4), 2001, pp. 371-383

Abstract

VLSI-based processor arrays have been widely used for computation intensive applications such as matrix and graph algorithms. Algorithm-based fault tolerance designs employing Various encoding/decoding schemes have been proposed for such systems to effectively tolerate operation time fault. In thispaper, we propose an efficient algorithm-based fault tolerance design using the weighted data-check relationship, where the checks are obtained from the weighted data. The relationship is systematically defined as a new (n, k, N-w) Hamming checksum code, where n is the size of the code word, k is the number of information elements in the code word, and N-w is the number of weights employed, respectively. The proposed design with various weights is evaluated in terms of time and hardware overhead as well as overflow probability and round-off error. Two different schemes employing the (n, k, 2)and (n, k, 3) Hamming checksum code are illustrated using important matrixcomputations. Comparison with other schemes reveals that the (n, k, 3) Hamming checksum scheme is very efficient, while the hardware overhead is small.

ASDD Area Sistemi Dipartimentali e Documentali, Università di Bologna, Catalogo delle riviste ed altri periodici
Documento generato il 02/10/20 alle ore 01:47:56