Imprecise computations

Liu, J.W.S.; Shih, Wei-Kuan; Lin, Kwei-Jay; Bettati, Riccardo; Chung, Jen-Yao

doi:10.1109/5.259428

Cited by 215 publications

(117 citation statements)

References 19 publications

Supporting

Mentioning

108

Contrasting

Unclassified

Order By: Relevance

“…Similar effects can also be observed for errors handled by a commit-rollback-recovery scheme [9]. Noncritical error effects have also been studied in the context of real-time systems under the heading of imprecise computation [20].…”

Section: Transient-error Tolerancementioning

confidence: 65%

See 1 more Smart Citation

Modeling and Mitigating Transient Errors in Logic Circuits

Polian

Hayes

Reddy

et al. 2011

IEEE Trans. Dependable and Secure Comput.

View full text Add to dashboard Cite

Abstract-Transient or soft errors caused by various environmental effects are a growing concern in micro and nanoelectronics. We present a general framework for modeling and mitigating the logical effects of such errors in digital circuits. We observe that some errors have time-bounded effects; the system's output is corrupted for a few clock cycles, after which it recovers automatically. Since such erroneous behavior can be tolerated by some applications, i.e., it is noncritical at the system level, we define the critical soft error rate (CSER) as a more realistic alternative to the conventional SER measure. A simplified technology-independent fault model, the single transient fault (STF), is proposed for efficiently estimating the error probabilities associated with individual nodes in both combinational and sequential logic. STFs can be used to compute various other useful metrics for the faults and errors of interest, and the required computations can leverage the large body of existing methods and tools designed for (permanent) stuck-at faults. As an application of the proposed methodology, we introduce a systematic strategy for hardening logic circuits against transient faults. The goal is to achieve a desired level of CSER at minimum cost by selecting a subset of nodes for hardening against STFs. Exact and approximate algorithms to solve the node selection problem are presented. The effectiveness of this approach is demonstrated by experiments with the ISCAS-85 and -89 benchmark suites, as well as some large (multimillion-gate) industrial circuits.

show abstract

Section: Transient-error Tolerancementioning

confidence: 65%

“…T h D , assuming s i ¼ 0 and c i ¼ SERðe i Þ ¼ 1 for all errors. (The overall cost of the hardening corresponds to the number of stuck-at faults excluded from (20) and the percentage of these faults among all faults.) The detection probability in the numerator of (20) has been obtained using (7).…”

Section: Combinational Circuitsmentioning

confidence: 99%

Modeling and Mitigating Transient Errors in Logic Circuits

Polian

Hayes

Reddy

et al. 2011

IEEE Trans. Dependable and Secure Comput.

View full text Add to dashboard Cite

show abstract

“…The additional feedforward integral controller compensates this undesired phenomenon thus providing a better error tracking while preserving satisfactory performance in the transient. 2,14,3,13,4,12,5,11,6,10,7,9,8,8,35,8,15,3,10} T (ms) 100 100…”

Section: Implementation On Rt-linux and Experimental Resultsmentioning

confidence: 99%

“…The total execution time of all optional parts within a sampling period depends on the scheduling policy. If optional sub-tasks are scheduled according to Sieve method, each one of them is entirely executed or rejected [5]. Assume that the control action u(t) is such that the optional sub-tasks of tasks τ 1 , τ 2 , ..., τ k will be executed in the period [tT, (t + 1)T ].…”

Section: Is the Number Of Instances Of Task τ I In The Period [Tt (Tmentioning

confidence: 99%

Optimal Control for Real-Time Feedback Rate-Monotonic Schedulers

Ayav

Ferrari-Trecate

2005

Computer and Information Sciences - ISCIS 2005

View full text Add to dashboard Cite

Abstract. This paper presents an optimal control scheme for a realtime feedback control rate-monotonic scheduling (FC-RMS) system. We consider two-version tasks composed of a mandatory and an optional part to be scheduled according to the FC-RMS. In FC-RMS, the controller provides a feedback strategy for deciding about the execution or rejection of the optional sub-tasks. By modeling the task execution times as random variables, we first find the statistical model of FC-RMS and then we design a pure optimal controller and an optimal controller with feedforward integral compensation. The comparison of these two schemes with common Proportional-Integral-Derivative (PID) controller highlights the benefit of the optimal scheme with integral compensation. The results are demonstrated through the real implementation of FC-RMS on RT-Linux.

show abstract

“…At the same time, for certain real-time applications approximate but timely results are acceptable, for example, fuzzy images in time are often preferable to perfect images too late. Imprecise Computation (IC) techniques [5] have been used for studying such systems. Tasks are composed of mandatory and optional parts, both of which must be finished by the deadline, although the optional part can be left incomplete at the expense of the quality of results (a function assigns reward depending on the amount of computation allotted to the optional part).…”

Section: Introductionmentioning

confidence: 99%