Algorithm-Based Fault Tolerance for FFT Networks

Sying Jyan Wang; Niraj K. Jha

doi:10.1109/12.293265

Algorithm-Based Fault Tolerance for FFT Networks

Sying Jyan Wang, Niraj K. Jha

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

77 Scopus citations

Abstract

Algorithm-based fault tolerance (ABFT) is a low-overhead system-level fault tolerance technique. Many ABFT schemes have been proposed in the past for fast Fourier transform (FFT) networks. In this work, 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 converge than previous schemes by Jou et al. and Tao et al.

Original language	English (US)
Pages (from-to)	849-854
Number of pages	6
Journal	IEEE Transactions on Computers
Volume	43
Issue number	7
DOIs	https://doi.org/10.1109/12.293265
State	Published - Jul 1994

All Science Journal Classification (ASJC) codes

Software
Theoretical Computer Science
Hardware and Architecture
Computational Theory and Mathematics

Keywords

Algorithm-based fault tolerance
concurrent error de-
errors
fast Fourier transform
hardware redundancy schemes
tection
transient

Access to Document

10.1109/12.293265

Cite this

@article{e85116d8f01248f88665add6676f2297,

title = "Algorithm-Based Fault Tolerance for FFT Networks",

abstract = "Algorithm-based fault tolerance (ABFT) is a low-overhead system-level fault tolerance technique. Many ABFT schemes have been proposed in the past for fast Fourier transform (FFT) networks. In this work, 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 converge than previous schemes by Jou et al. and Tao et al.",

keywords = "Algorithm-based fault tolerance, concurrent error de-, errors, fast Fourier transform, hardware redundancy schemes, tection, transient",

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

note = "Funding Information: Manuscript received April 9, 1992. This work was supported in part by ONR under contract “14-91-J-1199 and in part by AFOSR under contract AFOSR-90-0144. This work is based on “Algorithm-based fault tolerance for FFT networks,” by S.-J. Wang and N. K. Jha which appeared in the Proceedings of the International Symposium on Circuits and Systems, San Diego, CA, May 1992, pp. 141-144. S.-J. Wang is with the Institute of Computer Science, National Chung-Hsing University, Taichung, Taiwan 40227, R.O.C. N. K. Jha is with the Department of Electrical Engineering, Princeton University, Princeton, NJ 08544 USA; e-mail; [email protected]. IEEE Log Number 9212768.",

year = "1994",

month = jul,

doi = "10.1109/12.293265",

language = "English (US)",

volume = "43",

pages = "849--854",

journal = "IEEE Transactions on Computers",

issn = "0018-9340",

publisher = "IEEE Computer Society",

number = "7",

}

TY - JOUR

T1 - Algorithm-Based Fault Tolerance for FFT Networks

AU - Wang, Sying Jyan

AU - Jha, Niraj K.

N1 - Funding Information: Manuscript received April 9, 1992. This work was supported in part by ONR under contract “14-91-J-1199 and in part by AFOSR under contract AFOSR-90-0144. This work is based on “Algorithm-based fault tolerance for FFT networks,” by S.-J. Wang and N. K. Jha which appeared in the Proceedings of the International Symposium on Circuits and Systems, San Diego, CA, May 1992, pp. 141-144. S.-J. Wang is with the Institute of Computer Science, National Chung-Hsing University, Taichung, Taiwan 40227, R.O.C. N. K. Jha is with the Department of Electrical Engineering, Princeton University, Princeton, NJ 08544 USA; e-mail; [email protected]. IEEE Log Number 9212768.

PY - 1994/7

Y1 - 1994/7

N2 - Algorithm-based fault tolerance (ABFT) is a low-overhead system-level fault tolerance technique. Many ABFT schemes have been proposed in the past for fast Fourier transform (FFT) networks. In this work, 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 converge than previous schemes by Jou et al. and Tao et al.

AB - Algorithm-based fault tolerance (ABFT) is a low-overhead system-level fault tolerance technique. Many ABFT schemes have been proposed in the past for fast Fourier transform (FFT) networks. In this work, 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 converge than previous schemes by Jou et al. and Tao et al.

KW - Algorithm-based fault tolerance

KW - concurrent error de-

KW - errors

KW - fast Fourier transform

KW - hardware redundancy schemes

KW - tection

KW - transient

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

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

U2 - 10.1109/12.293265

DO - 10.1109/12.293265

M3 - Article

AN - SCOPUS:0028465953

SN - 0018-9340

VL - 43

SP - 849

EP - 854

JO - IEEE Transactions on Computers

JF - IEEE Transactions on Computers

IS - 7

ER -

Algorithm-Based Fault Tolerance for FFT Networks

Abstract

All Science Journal Classification (ASJC) codes

Keywords

Access to Document

Other files and links

Fingerprint

Cite this