Programming Approximate Systems
- đ¤ Speaker: Adrian Sampson, University of Washington
- đ Date & Time: Wednesday 04 December 2013, 11:00 - 12:00
- đ Venue: Auditorium, Microsoft Research Ltd, 21 Station Road, Cambridge, CB1 2FB
Abstract
Computers spend time, energy, and complexity on providing error-free program execution. But while accuracy is clearly critical for some tasks, perfect precision is wasted on many kinds of programs. For applications from domains like graphics, vision, machine learning, and games, perfect precision is unnecessary or even unattainable. Approximate computing techniques exploit these programs’ error resilience to make them more efficient. In this talk, I’ll outline some of the recent work going on at UW to make approximate computing useful from both hardware and software perspectives. On the hardware side, we’ve applied approximation to make solid-state memories like PCM faster, denser, and longer-lasting. In software, we’re designing programmer tools and compilers that help guide programmers toward good balances between performance and output quality.
Series This talk is part of the Microsoft Research Cambridge, public talks series.
Included in Lists
- All Talks (aka the CURE list)
- Auditorium, Microsoft Research Ltd, 21 Station Road, Cambridge, CB1 2FB
- bld31
- Cambridge Centre for Data-Driven Discovery (C2D3)
- Cambridge talks
- Chris Davis' list
- Guy Emerson's list
- Interested Talks
- Microsoft Research Cambridge, public talks
- ndk22's list
- ob366-ai4er
- Optics for the Cloud
- personal list
- PMRFPS's
- rp587
- School of Technology
- Trust & Technology Initiative - interesting events
- yk449
Note: Ex-directory lists are not shown.
![[Talks.cam]](/static/images/talkslogosmall.gif)

Adrian Sampson, University of Washington
Wednesday 04 December 2013, 11:00-12:00