Multi-Objective Application-Driven Approximate Design Method

被引:18
作者
Barone, Salvatore [1 ]
Traiola, Marcello [2 ]
Barbareschi, Mario [1 ]
Bosio, Alberto [2 ]
机构
[1] Univ Naples Federico II, Dept Elect Engn & Informat Technol, I-80125 Naples, Italy
[2] Univ Lyon, UCBL, CNRS, CPE Lyon,ECL,INSA Lyon,INL, F-69130 Ecully, France
关键词
Approximate computing; evolutionary algorithm; design space exploration; code mutation; CIRCUITS;
D O I
10.1109/ACCESS.2021.3087858
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Approximate Computing (AxC) paradigm aims at designing computing systems that can satisfy the rising performance demands and improve the energy efficiency. AxC exploits the gap between the level of accuracy required by the users, and the actual precision provided by the computing system, for achieving diverse optimizations. Various AxC techniques have been proposed so far in the literature at different abstraction levels from hardware to software. These techniques have been successfully utilized and combined to realize approximate implementations of applications in various domains (e.g. data analytic, scientific computing, multimedia and signal processing, and machine learning). Unfortunately, state-of-the-art approximation methodologies focus on a single abstraction level, such as combining elementary components (e.g., arithmetic operations) which are firstly approximated using component-level metrics and then combined to provide a good trade-off between efficiency and accuracy at the application level. This hinders the possibility for designers to explore different approximation opportunities, optimized for different applications and implementation targets. Therefore, we designed and implemented E-IDEA, an automatic framework that provides an application-driven approximation approach to find the best approximate versions of a given application targeting different implementations (i.e., hardware and software). E-IDEA compounds 1) a source-to-source manipulation tool and 2) an evolutionary search engine to automatically realize approximate application variants and perform a Design-Space Exploration (DSE). The latter results in a set of non-dominate approximate solutions in terms of trade-off between accuracy and efficiency. Experimental results validate the effectiveness and the flexibility of the approach in generating optimized approximate implementations of different applications, by using different approximation techniques and different accuracy/error metrics and for different implementation targets.
引用
收藏
页码:86975 / 86993
页数:19
相关论文
共 47 条
[1]  
[Anonymous], 2001, COMPUTER VISION
[2]  
[Anonymous], 2012, USC SIPI IMAGE DATAB
[3]  
[Anonymous], 1985, Design Optimization, DOI DOI 10.1016/B978-0-12-280910-1.50012-X
[4]  
[Anonymous], P C DES AUT TEST EUR
[5]   Automatic Design Space Exploration of Approximate Algorithms for Big Data Applications [J].
Barbareschi, Mario ;
Iannucci, Federico ;
Mazzeo, Antonino .
IEEE 30TH INTERNATIONAL CONFERENCE ON ADVANCED INFORMATION NETWORKING AND APPLICATIONS WORKSHOPS (WAINA 2016), 2016, :40-45
[6]  
Chippa Vinay K., 2013, PROC 50 ANN DESIGN A, DOI [DOI 10.1145/2463209.2488873, 10.1145/2463209.2488873]
[7]   Modular inversion based on digit-level speculative addition [J].
Cilardo, A. .
ELECTRONICS LETTERS, 2013, 49 (25) :1609-1610
[8]  
Cilardo A., 2015, FIELD PROGRAMMABLE L, P1
[9]  
Cilardo A, 2009, DES AUT TEST EUROPE, P664
[10]  
Deb K., 2000, Parallel Problem Solving from Nature PPSN VI. 6th International Conference. Proceedings (Lecture Notes in Computer Science Vol.1917), P849