EAFT: Evolutionary algorithms for GCC flag tuning

Abstract

The runtime of written codes is a matter of great importance, especially for code that is compiled once and executed multiple times. It is very important for developers to ensure that the resources required by a code are used as efficiently as possible, and that the runtime is as low as possible. Developers who use compilers such as GCC or LLVM to compile and run code written in C or C++ can optimize their code manually and, with certain optimization pointers, are able to make it run faster. This will provide the shorter runtime, but completıng this manual optimization is within the abilities of every developer since determining the right combination from more than 200 flags requires significant expertise. Many studies have tackled this issue. In this study, Evolutionary Algorithms for GCC Flag Tuning (EAFT) have been developed as a solution to this problem. This Autotuner, which is completely open-source, runs the code provided by the end user according to the specifications also selected by the end user, and searches for the most suitable optimization markers. For the code to be given In line with this study, which specifically addresses the end user, the user can input the code path directly from the Terminal, as well as specify the selection method and the crossover to be used. These choices can be made without the need to alter the code. The genetic algorithm and particle swarm optimization to be used is also presented to the user in EAFT, and unlike in other studies, genetic algorithm contain not one but several models.