Title
Efficient Local Memory Support for Approximate Computing
Abstract
Given the saturation of single-threaded performance improvements in General-Purpose Processors (GPPs), novel architectural techniques are required to meet emerging demands. In this paper, we propose a generic acceleration framework for approximate algorithms that replaces computation with table look-up accesses in dedicated memories. At compile time, annotated application kernels are automatically profiled using sample inputs, and the most representative input-output mappings of each kernel are selected by using K-Means Clustering and saved in the program binary. At runtime, these mappings are loaded into dedicated look-up tables, and kernel execution is replaced by hardware execution of the Nearest-Centroid Classifier, which selects from memory the best matching output to the region. We show a comparison with a similar framework based on neural acceleration and that, under similar levels of quality, the proposed approach achieves on average three times better performance and energy with significant area savings, thus opening new opportunities for performance harvesting in approximate accelerators.
Year
DOI
Venue
2018
10.1109/SBESC.2018.00026
2018 VIII Brazilian Symposium on Computing Systems Engineering (SBESC)
Keywords
Field
DocType
approximate computing,approximate memoization,data clustering,reuse
Kernel (linear algebra),Reuse,Compile time,Computer science,Parallel computing,Acceleration,Cluster analysis,Classifier (linguistics),Computation,Binary number
Conference
ISSN
ISBN
Citations 
2324-7886
978-1-7281-0240-5
0
PageRank 
References 
Authors
0.34
0
8