Proceedings 2001 IEEE International Symposium on Defect and Fault Tolerance in VLSI Systems
DOI: 10.1109/dftvs.2001.966800
|View full text |Cite
|
Sign up to set email alerts
|

Performance evaluation of checksum-based ABFT

Abstract: In Algorithm-based fault tolerance (ABFT)

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

1
12
0

Publication Types

Select...
4
4

Relationship

0
8

Authors

Journals

citations
Cited by 19 publications
(13 citation statements)
references
References 11 publications
1
12
0
Order By: Relevance
“…The proposed scheme has general applicability to tackle most error cases which might happen during computation or transmission. In addition, the scheme is consistent with the performance evaluation of check sum based ABFT [23].…”
Section: Multiple Errors Correction In the 3-d Mesh-knight Coordinatesupporting
confidence: 70%
“…The proposed scheme has general applicability to tackle most error cases which might happen during computation or transmission. In addition, the scheme is consistent with the performance evaluation of check sum based ABFT [23].…”
Section: Multiple Errors Correction In the 3-d Mesh-knight Coordinatesupporting
confidence: 70%
“…Existing techniques that can ensure reliability to SDCs comprise two categories: (i) algorithm-based fault tolerance 1 (ABFT)-i.e., methods using checksums specifically tailored to the algorithm under consideration-that can reliably detect (and possibly correct) up to a limited number of SDCs [13], [17], [19], [25], [39], [46], [47], [60]; (ii) systems with dual modular redundancy (DMR), where all non-coinciding SDCs can be detected if the same operation is duplicated in two separate processors (or threads) that cross-validate their results [21], but SDCs cannot be corrected without using triple modular redundancy (TMR) [23].…”
Section: A Summary Of Prior Workmentioning
confidence: 99%
“…However, when multiple SDCs occur within a subblock multiplication, ABFT cannot pinpoint their exact locations and requires recomputation of results, which is termed as "rollback ABFT" [1]. For example, given the ±ε and δ error pattern shown in Figure 2, ABFT flags locations r 3,1 and r 3,3 as erroneous, while two other erroneous locations, r 1,1 and r 1,3 go undetected due to the cancellation effect of the given error pattern.…”
Section: A Algorithm-based Fault Tolerancementioning
confidence: 99%
“…Various algorithms implementing ABFT are available in the literature [37][38][39][40][41][42][43]. However, the disadvantage is that this technique should be tailored specifically for each algorithm, requiring time-consuming algorithm development.…”
Section: Algorithmic Based Fault Tolerance (Abft)mentioning
confidence: 99%