Algorithm-based fault tolerance for FFT networks

Sying Jyan Wang; Niraj K. Jha

doi:10.1109/ISCAS.1992.229994

Algorithm-based fault tolerance for FFT networks

Sying Jyan Wang, Niraj K. Jha

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

11 Scopus citations

Abstract

Algorithm-based fault tolerance (ABFT) is a low-overhead technique for incorporating fault tolerance into multiprocessor architectures. Many ABFT schemes have been proposed in (he past for fast Fourier transform (FFT) networks. In this paper, a new ABFT scheme for FFT networks is proposed. We show that the new approach maintains the high throughput of previous schemes, yet needs lower hardware overhead and achieves higher fault coverage than previous schemes by Jou et al and Tao et al.

Original language	English (US)
Title of host publication	1992 IEEE International Symposium on Circuits and Systems, ISCAS 1992
Publisher	Institute of Electrical and Electronics Engineers Inc.
Pages	141-144
Number of pages	4
ISBN (Electronic)	0780305930
DOIs	https://doi.org/10.1109/ISCAS.1992.229994
State	Published - 1992
Event	1992 IEEE International Symposium on Circuits and Systems, ISCAS 1992 - San Diego, United States Duration: May 10 1992 → May 13 1992

Publication series

Name	Proceedings - IEEE International Symposium on Circuits and Systems
Volume	1
ISSN (Print)	0271-4310

Conference

Conference	1992 IEEE International Symposium on Circuits and Systems, ISCAS 1992
Country/Territory	United States
City	San Diego
Period	5/10/92 → 5/13/92

All Science Journal Classification (ASJC) codes

Electrical and Electronic Engineering

Access to Document

10.1109/ISCAS.1992.229994

Cite this

@inproceedings{bcdd9b67ea534219b58f42a9e3fd10e4,

title = "Algorithm-based fault tolerance for FFT networks",

abstract = "Algorithm-based fault tolerance (ABFT) is a low-overhead technique for incorporating fault tolerance into multiprocessor architectures. Many ABFT schemes have been proposed in (he past for fast Fourier transform (FFT) networks. In this paper, a new ABFT scheme for FFT networks is proposed. We show that the new approach maintains the high throughput of previous schemes, yet needs lower hardware overhead and achieves higher fault coverage than previous schemes by Jou et al and Tao et al.",

author = "Wang, {Sying Jyan} and Jha, {Niraj K.}",

note = "Publisher Copyright: {\textcopyright} 1992 IEEE.; 1992 IEEE International Symposium on Circuits and Systems, ISCAS 1992 ; Conference date: 10-05-1992 Through 13-05-1992",

year = "1992",

doi = "10.1109/ISCAS.1992.229994",

language = "English (US)",

series = "Proceedings - IEEE International Symposium on Circuits and Systems",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

pages = "141--144",

booktitle = "1992 IEEE International Symposium on Circuits and Systems, ISCAS 1992",

address = "United States",

}

Wang, SJ & Jha, NK 1992, Algorithm-based fault tolerance for FFT networks. in 1992 IEEE International Symposium on Circuits and Systems, ISCAS 1992., 229994, Proceedings - IEEE International Symposium on Circuits and Systems, vol. 1, Institute of Electrical and Electronics Engineers Inc., pp. 141-144, 1992 IEEE International Symposium on Circuits and Systems, ISCAS 1992, San Diego, United States, 5/10/92. https://doi.org/10.1109/ISCAS.1992.229994

Algorithm-based fault tolerance for FFT networks. / Wang, Sying Jyan; Jha, Niraj K.
1992 IEEE International Symposium on Circuits and Systems, ISCAS 1992. Institute of Electrical and Electronics Engineers Inc., 1992. p. 141-144 229994 (Proceedings - IEEE International Symposium on Circuits and Systems; Vol. 1).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

TY - GEN

T1 - Algorithm-based fault tolerance for FFT networks

AU - Wang, Sying Jyan

AU - Jha, Niraj K.

PY - 1992

Y1 - 1992

N2 - Algorithm-based fault tolerance (ABFT) is a low-overhead technique for incorporating fault tolerance into multiprocessor architectures. Many ABFT schemes have been proposed in (he past for fast Fourier transform (FFT) networks. In this paper, a new ABFT scheme for FFT networks is proposed. We show that the new approach maintains the high throughput of previous schemes, yet needs lower hardware overhead and achieves higher fault coverage than previous schemes by Jou et al and Tao et al.

AB - Algorithm-based fault tolerance (ABFT) is a low-overhead technique for incorporating fault tolerance into multiprocessor architectures. Many ABFT schemes have been proposed in (he past for fast Fourier transform (FFT) networks. In this paper, a new ABFT scheme for FFT networks is proposed. We show that the new approach maintains the high throughput of previous schemes, yet needs lower hardware overhead and achieves higher fault coverage than previous schemes by Jou et al and Tao et al.

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

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

U2 - 10.1109/ISCAS.1992.229994

DO - 10.1109/ISCAS.1992.229994

M3 - Conference contribution

AN - SCOPUS:84938162233

T3 - Proceedings - IEEE International Symposium on Circuits and Systems

SP - 141

EP - 144

BT - 1992 IEEE International Symposium on Circuits and Systems, ISCAS 1992

PB - Institute of Electrical and Electronics Engineers Inc.

T2 - 1992 IEEE International Symposium on Circuits and Systems, ISCAS 1992

Y2 - 10 May 1992 through 13 May 1992

ER -

Algorithm-based fault tolerance for FFT networks

Abstract

Publication series

Conference

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this