Verifying quantitative reliability for programs that execute on unreliable hardware
Emerging high-performance architectures are anticipated to contain unreliable components that may exhibit soft errors, which silently corrupt the results of computations. Full detection and masking of soft errors is challenging, expensive, and, for some applications, unnecessary. For example, approx...
Main Authors: | Misailovic, Sasa, Rinard, Martin C., Carbin, Michael James |
---|---|
Other Authors: | Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory |
Format: | Article |
Language: | en_US |
Published: |
Association for Computing Machinery (ACM)
2015
|
Online Access: | http://hdl.handle.net/1721.1/93888 https://orcid.org/0000-0003-0313-9270 https://orcid.org/0000-0001-8095-8523 |
Similar Items
-
Verifying Quantitative Reliability of Programs That Execute on Unreliable Hardware
by: Carbin, Michael, et al.
Published: (2013) -
Verified integrity properties for safe approximate program transformations
by: Kim, Deokhwan, et al.
Published: (2014) -
Proving acceptability properties of relaxed nondeterministic approximate programs
by: Carbin, Michael James, et al.
Published: (2012) -
Reasoning about Relaxed Programs
by: Carbin, Michael, et al.
Published: (2011) -
Chisel: Reliability- and Accuracy-Aware Optimization of Approximate Computational Kernels
by: Misailovic, Sasa, et al.
Published: (2014)