Model-Based Loop Perforation

被引:3
作者
Maier, Daniel [1 ]
Juurlink, Ben [1 ]
机构
[1] Tech Univ Berlin, Berlin, Germany
来源
EURO-PAR 2021: PARALLEL PROCESSING WORKSHOPS | 2022年 / 13098卷
关键词
Approximate Computing; Compiler; GPU; Loop optimization; Kernel perforation;
D O I
10.1007/978-3-031-06156-1_48
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
In many applications there is a gap between the accuracy provided by the platform and the accuracy that is required by the application to produce good-enough results. Exploiting this gap specifically is the concept of Approximate Computing, where a small reduction in accuracy is traded for better performance or a reduction in energy consumption. We assess applications regarding their suitability to be approximated. We propose a novel approach for memory-aware perforation of GPU kernels. The technique is further optimized, and we show its applicability on embedded GPUs. In order to fully utilize the opportunities of our approach, we propose a novel framework for automatic loop nest approximation based on polyhedral compilation. Our approach generalizes state-of-the-art perforation techniques and introduces new multidimensional perforation schemes. Moreover, the approach is augmented with a reconstruction technique that significantly improves the accuracy of the results. As the transformation space is potentially large, we propose a pruning method to remove low-quality transformations.
引用
收藏
页码:549 / 554
页数:6
相关论文
共 10 条
[1]   TAFFO: Tuning Assistant for Floating to Fixed Point Optimization [J].
Cherubin, Stefano ;
Cattaneo, Daniele ;
Chiari, Michele ;
Di Bello, Antonio ;
Agosta, Giovanni .
IEEE EMBEDDED SYSTEMS LETTERS, 2020, 12 (01) :5-8
[2]  
Chippa VK, 2013, DES AUT CON
[3]  
Lal S, 2019, DES AUT TEST EUROPE, P1184, DOI [10.23919/date.2019.8714810, 10.23919/DATE.2019.8714810]
[4]   Sculptor: Flexible Approximation with Selective Dynamic Loop Perforation [J].
Li, Shikai ;
Park, Sunghyun ;
Mahlke, Scott .
INTERNATIONAL CONFERENCE ON SUPERCOMPUTING (ICS 2018), 2018, :341-351
[5]  
Maier Daniel, 2019, 2019 International Conference on High Performance Computing & Simulation (HPCS), P329, DOI 10.1109/HPCS48598.2019.9188051
[6]   ALONA: Automatic Loop Nest Approximation with Reconstruction and Space Pruning [J].
Maier, Daniel ;
Cosenza, Biagio ;
Juurlink, Ben .
EURO-PAR 2021: PARALLEL PROCESSING, 2021, 12820 :3-18
[7]   Local Memory-Aware Kernel Perforation [J].
Maier, Daniel ;
Cosenza, Biagio ;
Juurlink, Ben .
PROCEEDINGS OF THE 2018 INTERNATIONAL SYMPOSIUM ON CODE GENERATION AND OPTIMIZATION (CGO'18), 2018, :290-299
[8]  
POUCHET LOUISNOEL, Polybench/C
[9]   Paraprox: Pattern-Based Approximation for Data Parallel Applications [J].
Samadi, Mehrzad ;
Jamshidi, Davoud Anoushe ;
Lee, Janghaeng ;
Mahlke, Scott .
ACM SIGPLAN NOTICES, 2014, 49 (04) :35-50
[10]   Approximate Storage in Solid-State Memories [J].
Sampson, Adrian ;
Nelson, Jacob ;
Strauss, Karin ;
Ceze, Luis .
ACM TRANSACTIONS ON COMPUTER SYSTEMS, 2014, 32 (03)