Proceedings of the 2014 ACM International Conference on Object Oriented Programming Systems Languages &Amp; Applications 2014
DOI: 10.1145/2660193.2660231
|View full text |Cite
|
Sign up to set email alerts
|

Chisel

Abstract: The accuracy of an approximate computation is the distance between the result that the computation produces and the corresponding fully accurate result. The reliability of the computation is the probability that it will produce an acceptably accurate result. Emerging approximate hardware platforms provide approximate operations that, in return for reduced energy consumption and/or increased performance, exhibit reduced reliability and/or accuracy.We present Chisel, a system for reliability-and accuracyaware op… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

0
14
0

Year Published

2017
2017
2021
2021

Publication Types

Select...
5
2

Relationship

1
6

Authors

Journals

citations
Cited by 82 publications
(14 citation statements)
references
References 38 publications
(39 reference statements)
0
14
0
Order By: Relevance
“…Rely [Carbin et al 2013] and Chisel [Misailovic et al 2014] introduced the idea of quantifiable reliability and absolute error at the program level. They define function-level specifications that express the maximum probability with which the function can produce an inaccurate result.…”
Section: Hardware Sensitivitymentioning
confidence: 99%
“…Rely [Carbin et al 2013] and Chisel [Misailovic et al 2014] introduced the idea of quantifiable reliability and absolute error at the program level. They define function-level specifications that express the maximum probability with which the function can produce an inaccurate result.…”
Section: Hardware Sensitivitymentioning
confidence: 99%
“…Input: Approximation levels, a (sorted with highest precision first), All registers in kernel, reдisters, Quality threshold, qt Globals: A mapping between registers and approximation levels, precision_o f _reдisters Output: precision_o f _reдisters 1 Algorithm setPrecisions(a, registers, qt) Set unlocked_reдisters in precision_o f _reдisters to current_precision 13 Execute kernel with precision_o f _reдisters 14 if output quality < qt then 15 if size of unlocked_registers is 1 then 16 Set unlocked_reдisters in precision_o f _reдisters to previous_precision In each iteration, all unlocked registers, that is, registers not locked to an approximation level, are considered (lines [11][12][13][14][15][16][17][18][19][20][21][22][23][24]. The unlocked registers are adjusted to the current level of approximation, the kernel is executed, and the output quality is tested against the quality threshold (lines 12-14).…”
Section: Algorithm 1: Precision-selection Algorithmmentioning
confidence: 99%
“…Misailovic et al [13] proposes a reliability-and accuracy-aware framework for optimizing approximate computational kernels, including interval analysis of source-code variables to bound the variables to minimum-required precisions. In contrast, our approach optimizes on actual data on assembly level, which makes it less likely to overestimate the required number of bits.…”
Section: Related Workmentioning
confidence: 99%
See 2 more Smart Citations