Exploiting Errors for Efficiency: A Survey from Circuits to Algorithms
Abstract
When a computational task tolerates a relaxation of its specification or when an algorithm tolerates the effects of noise in its execution, hardware, programming languages, and system software can trade deviations from correct behavior for lower resource usage. We present, for the first time, a synthesis of research results on computing systems that only make as many errors as their users can tolerate, from across the disciplines of computer aided design of circuits, digital system design, computer architecture, programming languages, operating systems, and information theory. Rather than over-provisioning resources at each layer to avoid errors, it can be more efficient to exploit the masking of errors occurring at one layer which can prevent them from propagating to a higher layer. We survey tradeoffs for individual layers of computing systems from the circuit level to the operating system level and illustrate the potential benefits of end-to-end approaches using two illustrative examples. To tie together the survey, we present a consistent formalization of terminology, across the layers, which does not significantly deviate from the terminology traditionally used by research communities in their layer of focus.
Cite
@article{arxiv.1809.05859,
title = {Exploiting Errors for Efficiency: A Survey from Circuits to Algorithms},
author = {Phillip Stanley-Marbell and Armin Alaghi and Michael Carbin and Eva Darulova and Lara Dolecek and Andreas Gerstlauer and Ghayoor Gillani and Djordje Jevdjic and Thierry Moreau and Mattia Cacciotti and Alexandros Daglis and Natalie Enright Jerger and Babak Falsafi and Sasa Misailovic and Adrian Sampson and Damien Zufferey},
journal= {arXiv preprint arXiv:1809.05859},
year = {2018}
}
Comments
35 pages