Approximate Loop Unrolling
Loading...
Date
2019-04-30
Journal Title
Journal ISSN
Volume Title
Publisher
CF '19 - PROCEEDINGS OF THE 16TH ACM INTERNATIONAL CONFERENCE ON COMPUTING FRONTIERS
Abstract
We introduce Approximate Unrolling, a compiler loop optimization that reduces execution time and energy consumption, exploiting code regions that can endure some approximation and still produce acceptable results. Specifically, this work focuses on counted loops that map a function over the elements of an array. Approximate Unrolling transforms loops similarly to Loop Unrolling. However, unlike its exact counterpart, our optimization does not unroll loops by adding exact copies of the loop's body. Instead, it adds code that interpolates the results of previous iterations.
Description
Keywords
approximate computing, compiler optimizations
Citation
Marcelino Rodriguez-Cancio, Benoit Combemale, and Benoit Baudry.
2019. Approximate Loop Unrolling. In Proceedings of the 16th conference
on Computing Frontiers (CF ’19), April 30-May 2, 2019, Alghero,
Italy. ACM, New York, NY, USA, 12 pages. https://doi.org/10.1145/3310273.3323841