· 2012
Architecture support for disciplined approximate programming
- 387citations
- 2012year
Short summary
Hardware can selectively apply approximate storage and computation without dynamic checks when compilers statically prove approximate code is isolated from precise code.
AI-generated from the title and abstract; the full text is not read.
Key points
- Disciplined approximate programming enables energy savings by allowing approximate computation.
- Compilers statically prove that approximate code is isolated from precise code.
- Hardware can apply approximate storage and computation without dynamic correctness checks.
AI-generated from the title and abstract; the full text is not read.
Abstract
Disciplined approximate programming lets programmers declare which parts of a program can be computed approximately and consequently at a lower energy cost. The compiler proves statically that all approximate computation is properly isolated from precise computation. The hardware is then free to selectively apply approximate storage and approximate computation with no need to perform dynamic correctness checks.
The authors' abstract, as published at the source., 2012 · DOI ↗
Continue with a free account
Ask the paper: 3 free questions a day about this paper; save it, get its citation, new summaries every day for your field. Takeaways are Premium.
Continue free on the webSign in with Google or Apple; no card needed. You come back to this paper.
On your phone:
Field: Hardware and Architecture
Hardware and ArchitectureComputer Science