2016 49th Annual IEEE/ACM International Symposium on Microarchitecture (MICRO) 2016
DOI: 10.1109/micro.2016.7783745
|View full text |Cite
|
Sign up to set email alerts
|

Approxilyzer: Towards a systematic framework for instruction-level approximate computing and its application to hardware resiliency

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
43
0

Year Published

2017
2017
2023
2023

Publication Types

Select...
4
3
1

Relationship

0
8

Authors

Journals

citations
Cited by 45 publications
(43 citation statements)
references
References 33 publications
0
43
0
Order By: Relevance
“…As oppose to semi or non-automated mechanisms, SAGE [Samadi et al 2013] proposes an automated approach by using online monitoring mechanism designed for GPU kernels. Closest to our work, Approxilyzer [Venkatagiri et al 2016] tries to find noise tolerant instructions in an application and classifies them as Masked, SDC-Good/Maybe/Bad, and detectable errors. This approach is automated; however, it is only limited to single bit errors.…”
Section: Related Workmentioning
confidence: 99%
“…As oppose to semi or non-automated mechanisms, SAGE [Samadi et al 2013] proposes an automated approach by using online monitoring mechanism designed for GPU kernels. Closest to our work, Approxilyzer [Venkatagiri et al 2016] tries to find noise tolerant instructions in an application and classifies them as Masked, SDC-Good/Maybe/Bad, and detectable errors. This approach is automated; however, it is only limited to single bit errors.…”
Section: Related Workmentioning
confidence: 99%
“…Other techniques include selective n-modular redundancy in which a developer either manually or with the support of a dynamic fault-injection tool identifies instructions or regions of code that do not need to be protected for the application to produce an acceptable resultÐas determined by an empirical evaluation [Carbin and Rinard 2010;Thomas and Pattabiraman 2016;Venkatagiri et al 2016;Vishal Chandra Sharma 2016]. Another class of techniques is fault-tolerant algorithms that through the addition of algorithm-specific checking and correction code are tolerant to faults [Du et al 2012;Hoemmen and Heroux 2011;Sao et al 2016;Sao and Vuduc 2013].…”
Section: Application-specific Fault Tolerancementioning
confidence: 99%
“…This makes it infeasible to conduct exhaustive fault injection campaigns for workloads with a high number of dynamic instructions. This is why prior work has either randomly sampled the error space, or used error clustering to find classes of equivalent errors which could then be pruned to facilitate exhaustive fault injection campaigns [14], [15], [16]. However, all of these papers have focused on single-bit errors, and hence their heuristics for sampling and clustering are specific to the single bit-flip scenario.…”
Section: Error Clustering and Error Samplingmentioning
confidence: 99%
“…Further, almost all the existing techniques for pruning the error space [14], [15], [16] work with the single-bit fault model, and are not easily extensible to multiple-bit errors. Therefore, in this paper, we also propose three ways of pruning the error space based on the fault injection results obtained.…”
Section: Introductionmentioning
confidence: 99%
See 1 more Smart Citation