Approximate computing survey, Part II: Application-specific & architectural approximation techniques and applications

V Leon, MA Hanif, G Armeniakos, X Jiao… - ACM Computing …, 2023 - dl.acm.org
The challenging deployment of compute-intensive applications from domains such as
Artificial Intelligence (AI) and Digital Signal Processing (DSP), forces the community of …

Exploiting errors for efficiency: A survey from circuits to applications

P Stanley-Marbell, A Alaghi, M Carbin… - ACM Computing …, 2020 - dl.acm.org
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 …

Crescent: taming memory irregularities for accelerating deep point cloud analytics

Y Feng, G Hammonds, Y Gan, Y Zhu - Proceedings of the 49th Annual …, 2022 - dl.acm.org
3D perception in point clouds is transforming the perception ability of future intelligent
machines. Point cloud algorithms, however, are plagued by irregular memory accesses …

HEIF: Highly efficient stochastic computing-based inference framework for deep neural networks

Z Li, J Li, A Ren, R Cai, C Ding, X Qian… - … on Computer-Aided …, 2018 - ieeexplore.ieee.org
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 …

A taxonomy of general purpose approximate computing techniques

T Moreau, J San Miguel, M Wyse… - IEEE Embedded …, 2017 - ieeexplore.ieee.org
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 …

Sculptor: Flexible approximation with selective dynamic loop perforation

S Li, S Park, S Mahlke - … of the 2018 International Conference on …, 2018 - dl.acm.org
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 …

Approximate memory compression

A Ranjan, A Raha, V Raghunathan… - IEEE Transactions on …, 2020 - ieeexplore.ieee.org
Memory subsystems are a major energy bottleneck in computing platforms due to frequent
transfers between processors and off-chip memory. We propose approximate memory …

DAPPER: Data aware approximate NoC for GPGPU architectures

VY Raparti, S Pasricha - 2018 Twelfth IEEE/ACM International …, 2018 - ieeexplore.ieee.org
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 …

X-DNNs: Systematic cross-layer approximations for energy-efficient deep neural networks

MA Hanif, A Marchisio, T Arif, R Hafiz… - Journal of Low …, 2018 - ingentaconnect.com
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 …

Thesaurus: Efficient cache compression via dynamic clustering

A Ghasemazar, P Nair, M Lis - Proceedings of the Twenty-Fifth …, 2020 - dl.acm.org
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 …