University of Cambridge > > Microsoft Research Cambridge, public talks > Programming Approximate Systems

Programming Approximate Systems

Add to your list(s) Download to your calendar using vCal

If you have a question about this talk, please contact Microsoft Research Cambridge Talks Admins.

This event may be recorded and made available internally or externally via Microsoft will own the copyright of any recordings made. If you do not wish to have your image/voice recorded please consider this before attending

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.

This talk is part of the Microsoft Research Cambridge, public talks series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.


© 2006-2022, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity