Smart selection of optimizations in dynamic compilers.
Saved in:
| Title: | Smart selection of optimizations in dynamic compilers. |
|---|---|
| Authors: | Martins do Rosario, Vanderson, Faustino da Silva, Anderson, Aparecida Silva Camacho, Thais, Napoli, Otávio O., Breternitz, Mauricio, Borin, Edson |
| Source: | Concurrency & Computation: Practice & Experience; 9/25/2021, Vol. 33 Issue 18, p1-16, 16p |
| Subject Terms: | COMPILERS (Computer programs), MACHINE learning, DYNAMICAL systems |
| Abstract: | Summary: Dynamic compilers perform compilation and generation of target code during runtime, implying that the compilation time is added into the program runtime. Thus, to build a high‐performing dynamic compilation system, it is crucial to be able to generate high‐quality code and, at the same time, have a small compilation cost. In this article, we present an approach that uses machine learning to select sequences of optimization for dynamic compilation that considers both code quality and compilation overhead. Our approach starts by training a model, offline, with a knowledge bank of those sequences with low overhead and high‐quality code generation capability using a genetic heuristic. Then, this bank is used to guide the smart selection of optimizations sequences for the compilation of code fragments during the emulation of an application. We evaluate the proposed strategy in two LLVM‐based dynamic binary translators, namely OI‐DBT and HQEMU, and show that these two translators can achieve average speedups of 1.26x and 1.15x in MiBench and Spec Cpu benchmarks, respectively. [ABSTRACT FROM AUTHOR] |
| Copyright of Concurrency & Computation: Practice & Experience is the property of Wiley-Blackwell and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) | |
| Database: | Complementary Index |
Be the first to leave a comment!
Full Text Finder
Nájsť tento článok vo Web of Science