Abstract
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.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Cherubin, S., Cattaneo, D., Chiari, M., Di Bello, A., Agosta, G.: TAFFO: tuning assistant for floating to fixed point optimization. IEEE Embed. Syst. Lett. 12(1), 5–8 (2019)
Chippa, V.K., Chakradhar, S.T., Roy, K., Raghunathan, A.: Analysis and characterization of inherent application resilience for approximate computing. In: Proceedings of the 50th Annual Design Automation Conference, pp. 1–9 (2013)
Lal, S., Lucas, J., Juurlink, B.: SLC: memory access granularity aware selective lossy compression for GPUs. In: 2019 Design, Automation & Test in Europe Conference & Exhibition (DATE), pp. 1184–1189. IEEE (2019)
Li, S., Park, S., Mahlke, S.: Sculptor: flexible approximation with selective dynamic loop perforation. In: Proceedings of the 2018 International Conference on Supercomputing, pp. 341–351 (2018)
Maier, D., Cosenza, B., Juurlink, B.: Local memory-aware kernel perforation. In: Proceedings of the 2018 International Symposium on Code Generation and Optimization, pp. 278–287 (2018)
Maier, D., Cosenza, B., Juurlink, B.: ALONA: automatic loop nest approximation with reconstruction and space pruning. In: Sousa, L., Roma, N., Tomás, P. (eds.) Euro-Par 2021. LNCS, vol. 12820, pp. 3–18. Springer, Cham (2021). https://doi.org/10.1007/978-3-030-85665-6_1
Maier, D., Mammeri, N., Cosenza, B., Juurlink, B.: Approximating memory-bound applications on mobile GPUs. In: 2019 International Conference on High Performance Computing & Simulation (HPCS), pp. 329–335. IEEE (2019)
Pouchet, L.N.: PolyBench/C. http://www.cse.ohio-state.edu/~pouchet/software/polybench/
Samadi, M., Jamshidi, D.A., Lee, J., Mahlke, S.: Paraprox: pattern-based approximation for data parallel applications. In: Proceedings of the 19th International Conference on Architectural Support for Programming Languages and Operating Systems, pp. 35–50 (2014)
Sampson, A., Nelson, J., Strauss, K., Ceze, L.: Approximate storage in solid-state memories. TOCS 32, 1–23 (2014)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2022 Springer Nature Switzerland AG
About this paper
Cite this paper
Maier, D., Juurlink, B. (2022). Model-Based Loop Perforation. In: Chaves, R., et al. Euro-Par 2021: Parallel Processing Workshops. Euro-Par 2021. Lecture Notes in Computer Science, vol 13098. Springer, Cham. https://doi.org/10.1007/978-3-031-06156-1_48
Download citation
DOI: https://doi.org/10.1007/978-3-031-06156-1_48
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-031-06155-4
Online ISBN: 978-3-031-06156-1
eBook Packages: Computer ScienceComputer Science (R0)