Estimating resource budgets to ensure autotuning efficiency
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216224%3A14610%2F25%3A00140674" target="_blank" >RIV/00216224:14610/25:00140674 - isvavai.cz</a>
Result on the web
<a href="https://www.sciencedirect.com/journal/parallel-computing/vol/123/suppl/C" target="_blank" >https://www.sciencedirect.com/journal/parallel-computing/vol/123/suppl/C</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1016/j.parco.2025.103126" target="_blank" >10.1016/j.parco.2025.103126</a>
Alternative languages
Result language
angličtina
Original language name
Estimating resource budgets to ensure autotuning efficiency
Original language description
Many state-of-the-art HPC applications rely on autotuning to maintain peak performance. Autotuning allows a program to be re-optimized for new hardware, settings, or input — even during execution. However, the approach has an inherent problem that has yet to be properly addressed: since the autotuning process itself requires computational resources, it is also subject to optimization. In other words, while autotuning aims to decrease a program’s run time by improving its efficiency, it also introduces additional overhead that can extend the overall run time. To achieve optimal performance, both the application and the autotuning process should be optimized together, treating them as a single optimization criterion. This framing allows us to determine a reasonable tuning budget to avoid both undertuning, where insufficient autotuning leads to suboptimal performance, and overtuning, where excessive autotuning imposes overhead that outweighs the benefits of program optimization. In this paper, we explore the tuning budget optimization problem in detail, highlighting its interesting properties and implications, which have largely been overlooked in the literature. Additionally, we present several viable solutions for tuning budget optimization and evaluate their efficiency across a range of commonly used HPC kernels.
Czech name
—
Czech description
—
Classification
Type
J<sub>imp</sub> - Article in a specialist periodical, which is included in the Web of Science database
CEP classification
—
OECD FORD branch
10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
Result continuities
Project
<a href="/en/project/LM2023054" target="_blank" >LM2023054: e-Infrastructure CZ</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)
Others
Publication year
2025
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Name of the periodical
PARALLEL COMPUTING
ISSN
0167-8191
e-ISSN
1872-7336
Volume of the periodical
2025
Issue of the periodical within the volume
123
Country of publishing house
NL - THE KINGDOM OF THE NETHERLANDS
Number of pages
15
Pages from-to
1-15
UT code for WoS article
001437878000001
EID of the result in the Scopus database
—