RT conference output
T1 A Two-step Approach to Find Short Compilation Transformation Sequences for Optimal Software Runtime Performance
A1 Torre Macías, Juan Carlos de la
A1 Aragón Jurado, José Miguel
A1 Jareño Dorado, Javier
A1 Dorronsoro Díaz, Bernabé
A1 Ruiz Villalobos, Patricia
A2 Ingeniería Informática
A2 Ingeniería Mecánica y Diseño Industrial
AB More efficient programs can be obtained by applying compiler optimization flags, i.e., sequences of code transformations. However, these generic sequences often underperform, as their effectiveness depends on both the software and hardware characteristics. This highlights the need for tailored transformation sequences. This paper introduces a new problem composed of two combinatorial optimization tasks aimed at finding optimal and minimal-length source code transformation sequences. Shorter sequences enable faster compilation using only the most effective transformations for a given program and hardware. We propose a two-step methodology to solve the problem: first, find sequences that minimize program runtime; second, reduce their length without degrading performance. Our approach produces sequences up to 51.27% shorter and over 26% faster compared to the -O3 flag.
PB Association for Computing Machinery
SN 979-8-4007-1464-1/2025/07
YR 2025
FD 2025
LK http://hdl.handle.net/10498/37261
UL http://hdl.handle.net/10498/37261
LA eng
DS Repositorio Institucional de la Universidad de Cádiz
RD 05-nov-2026