Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Appears in the Proceedings of 17th International Conference on Architectural Support for Programming Languages and Operating
 

Summary: Appears in the Proceedings of 17th
International Conference on Architectural Support for Programming Languages and Operating
Systems (ASPLOS'12)
Architecture Support for
Disciplined Approximate Programming
Hadi Esmaeilzadeh Adrian Sampson Luis Ceze
University of Washington
Department of Computer Science & Engineering
{hadianeh,asampson,luisceze}@cs.washington.edu
Doug Burger
Microsoft Research
dburger@microsoft.com
Abstract
Disciplined approximate programming lets programmers declare
which parts of a program can be computed approximately and con-
sequently 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 ap-
proximate storage and approximate computation with no need to
perform dynamic correctness checks.

  

Source: Anderson, Richard - Department of Computer Science and Engineering, University of Washington at Seattle

 

Collections: Computer Technologies and Information Sciences