| Full text | |
| Author(s): |
Martins do Rosario, Vanderson
[1]
;
Faustino da Silva, Anderson
[2]
;
Aparecida Silva Camacho, Thais
[1, 2]
;
Napoli, Otavio O.
[1]
;
Breternitz, Mauricio
[3]
;
Borin, Edson
[1]
Total Authors: 6
|
| Affiliation: | [1] Univ Campinas UNICAMP, IC, Av Albert Einstein, 1251 Cidade Univ, BR-13083852 Sao Paulo - Brazil
[2] Univ Estadual Maringa UEM, DIN, Maringa, Parana - Brazil
[3] Inst Univ Lisboa, ISTAR IUL, Lisbon - Portugal
Total Affiliations: 3
|
| Document type: | Journal article |
| Source: | CONCURRENCY AND COMPUTATION-PRACTICE & EXPERIENCE; v. 33, n. 18, SI SEP 25 2021. |
| Web of Science Citations: | 1 |
| Abstract | |
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. (AU) | |
| FAPESP's process: | 13/08293-7 - CCES - Center for Computational Engineering and Sciences |
| Grantee: | Munir Salomao Skaf |
| Support Opportunities: | Research Grants - Research, Innovation and Dissemination Centers - RIDC |