2022
DOI: 10.1109/tvlsi.2021.3119511
|View full text |Cite
|
Sign up to set email alerts
|

Low-Cost Online Convolution Checksum Checker

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
11
0

Year Published

2022
2022
2024
2024

Publication Types

Select...
4
3

Relationship

1
6

Authors

Journals

citations
Cited by 13 publications
(11 citation statements)
references
References 31 publications
0
11
0
Order By: Relevance
“…Algorithm-Based Fault Tolerance (ABFT): Another line of research leverages algorithmic perspective to make DNNs reliable. These methods, known as ABFT [21], [22], [23], [24], typically compute checksums for input data, which are then stored alongside the original data. Then, both the original and redundant computations are conducted to verify outputs.…”
Section: Related Workmentioning
confidence: 99%
“…Algorithm-Based Fault Tolerance (ABFT): Another line of research leverages algorithmic perspective to make DNNs reliable. These methods, known as ABFT [21], [22], [23], [24], typically compute checksums for input data, which are then stored alongside the original data. Then, both the original and redundant computations are conducted to verify outputs.…”
Section: Related Workmentioning
confidence: 99%
“…To reduce the overhead, a lightweight ABFT, namely Con-vGuard has been proposed by state-of-the-art research [83], which only predicts the convolution checksum on the border pixels of the input feature map. ConvGuard computes the checksum of the output pixels and compares it to its predicted checksum value in parallel to the operation of the convolution engine.…”
Section: B Algorithm-level Resiliencementioning
confidence: 99%
“…FIGURE 10. Generalized ConvGuard architecture that supports arbitrary convolutions (modified from[83]). …”
mentioning
confidence: 99%
“…Huang and Abraham introduced Algorithm Based Fault Tolerance (ABFT) for matrix algebra operation [17]. ABFT has been demonstrated to be robust and attractive with overhead ratio of O(1/N ), with N being the size of the matrices.…”
Section: B Algorithmic Schemesmentioning
confidence: 99%