Approximate computing survey, Part II: Application-specific & architectural approximation techniques and applications
The challenging deployment of compute-intensive applications from domains such as
Artificial Intelligence (AI) and Digital Signal Processing (DSP), forces the community of …
Artificial Intelligence (AI) and Digital Signal Processing (DSP), forces the community of …
Exploiting errors for efficiency: A survey from circuits to applications
When a computational task tolerates a relaxation of its specification or when an algorithm
tolerates the effects of noise in its execution, hardware, system software, and programming …
tolerates the effects of noise in its execution, hardware, system software, and programming …
Crescent: taming memory irregularities for accelerating deep point cloud analytics
3D perception in point clouds is transforming the perception ability of future intelligent
machines. Point cloud algorithms, however, are plagued by irregular memory accesses …
machines. Point cloud algorithms, however, are plagued by irregular memory accesses …
HEIF: Highly efficient stochastic computing-based inference framework for deep neural networks
Deep convolutional neural networks (DCNNs) are one of the most promising deep learning
techniques and have been recognized as the dominant approach for almost all recognition …
techniques and have been recognized as the dominant approach for almost all recognition …
A taxonomy of general purpose approximate computing techniques
Approximate computing is the idea that systems can gain performance and energy efficiency
if they expend less effort on producing a “perfect” answer. Approximate computing …
if they expend less effort on producing a “perfect” answer. Approximate computing …
Sculptor: Flexible approximation with selective dynamic loop perforation
Loop perforation is one of the most well known software techniques in approximate
computing. It transforms loops to periodically skip subsets of their iterations. It is general …
computing. It transforms loops to periodically skip subsets of their iterations. It is general …
Approximate memory compression
Memory subsystems are a major energy bottleneck in computing platforms due to frequent
transfers between processors and off-chip memory. We propose approximate memory …
transfers between processors and off-chip memory. We propose approximate memory …
DAPPER: Data aware approximate NoC for GPGPU architectures
High interconnect bandwidth is crucial to achieve better performance in many-core GPGPU
architectures that execute highly data parallel applications. The parallel warps of threads …
architectures that execute highly data parallel applications. The parallel warps of threads …
X-DNNs: Systematic cross-layer approximations for energy-efficient deep neural networks
Growing interest towards the development of smart Cyber Physical Systems (CPS) and
Internet of Things (IoT) has motivated the researchers to explore the suitability of carrying out …
Internet of Things (IoT) has motivated the researchers to explore the suitability of carrying out …
Thesaurus: Efficient cache compression via dynamic clustering
In this paper, we identify a previously untapped source of compressibility in cache working
sets: clusters of cachelines that are similar, but not identical, to one another. To compress …
sets: clusters of cachelines that are similar, but not identical, to one another. To compress …