Abstract

The Optimization Selection Problem is widely known in computer science for its complexity and importance. Several approaches based on machine learning and iterative compilation have been proposed to mitigate this problem. Although these approaches provide several advantages, they have disadvantages that can hinder the performance. This paper proposes a hybrid approach that combines the best of machine learning and iterative compilation. Several experiments were performed using different strategies, metrics and hardware platforms. A thorough analysis of the results reveals that the hybrid approach is a considerable improvement over machine learning and iterative compilation. In addition, the hybrid approach outperforms the best compiler optimization level of LLVM.

Keywords

MSC

68-N20

Cite this article

@article{cai-4505,
  author  = {Nilton Luiz Queiroz Junior and Anderson Faustino da Silva and Luis Gustavo Araujo Rodriguez},
  title   = {Finding Effective Compiler Optimization Sequences: A Hybrid Approach},
  journal = {Computing and Informatics},
  volume  = {39},
  number  = {6},
  pages   = {1117--1147},
  year    = {2020},
  issn    = {1335-9150},
  doi     = {10.31577/cai_2020_6_1117}
}
Download .bib