z-logo
open-access-imgOpen Access
A Survey of Techniques for Approximate Computing
Author(s) -
Sparsh Mittal
Publication year - 2016
Publication title -
acm computing surveys
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 2.079
H-Index - 163
eISSN - 1557-7341
pISSN - 0360-0300
DOI - 10.1145/2893356
Subject(s) - computer science , key (lock) , computation , quality (philosophy) , field programmable gate array , resource (disambiguation) , mainstream , parallel computing , computer engineering , embedded system , operating system , algorithm , computer network , philosophy , theology , epistemology
Approximate computing trades off computation quality with effort expended, and as rising performance demands confront plateauing resource budgets, approximate computing has become not merely attractive, but even imperative. In this article, we present a survey of techniques for approximate computing (AC). We discuss strategies for finding approximable program portions and monitoring output quality, techniques for using AC in different processing units (e.g., CPU, GPU, and FPGA), processor components, memory technologies, and so forth, as well as programming frameworks for AC. We classify these techniques based on several key characteristics to emphasize their similarities and differences. The aim of this article is to provide insights to researchers into working of AC techniques and inspire more efforts in this area to make AC the mainstream computing approach in future systems.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom