Exploiting historical data: pruning autotuning spaces and
estimating the number of tuning steps

D 2019

Exploiting historical data: pruning autotuning spaces and estimating the number of tuning steps

OĽHA, Jaroslav, Jana HOZZOVÁ, Jan FOUSEK a Jiří FILIPOVIČ

Základní údaje

Originální název

Exploiting historical data: pruning autotuning spaces and estimating the number of tuning steps

Název česky

Využití historických dat: prořezávání prostorů v autotuningu a odhad počtu tunících kroků

Autoři

OĽHA, Jaroslav (703 Slovensko, domácí), Jana HOZZOVÁ (703 Slovensko, domácí), Jan FOUSEK (203 Česká republika, domácí) a Jiří FILIPOVIČ (203 Česká republika, garant, domácí)

Vydání

Cham, Switzerland, Lecture Notes in Computer Science, od s. 295-307, 13 s. 2019

Nakladatel

Springer, Cham

Další údaje

Jazyk

angličtina

Typ výsledku

Stať ve sborníku

Obor

10201 Computer sciences, information science, bioinformatics

Stát vydavatele

Švýcarsko

Utajení

není předmětem státního či obchodního tajemství

Forma vydání

tištěná verze "print"

Impakt faktor

Impact factor: 0.402 v roce 2005

Kód RIV

RIV/00216224:14610/19:00115100

Organizační jednotka

Ústav výpočetní techniky

ISBN

978-3-030-48339-5

ISSN

DOI

http://dx.doi.org/10.1007/978-3-030-48340-1_23

UT WoS

000850928600023

Klíčová slova česky

autotuning; odhad ceny tuningu; prořezávání prostoru tuningu; analýza senzitivity

Klíčová slova anglicky

Autotuning; prediction of tuning cost; tuning space pruning; sensitivity analysis

Příznaky

Mezinárodní význam, Recenzováno

Změněno: 16. 8. 2023 15:53, RNDr. Pavel Šmerk, Ph.D.

Anotace

V originále

Autotuning, the practice of automatic tuning of code to provide performance portability, has received increased attention in the research community, especially in high performance computing. Ensuring high performance on a variety of hardware usually means modifications to the code, often via different values of a selected set of parameters, such as tiling size, loop unrolling factor or data layout. However, the search space of all possible combinations of these parameters can be enormous. Traditional search methods often fail to find a well-performing set of parameter values quickly. We have found that certain properties of tuning spaces do not vary much when hardware is changed. In this paper, we demonstrate that it is possible to use historical data to reliably predict the number of tuning steps necessary to find a well-performing configuration, and to reduce the size of the tuning space. We evaluate our hypotheses on a number of GPU-accelerated benchmarks written in CUDA and OpenCL.

Návaznosti

EF16_013/0001802, projekt VaV

Název: CERIT Scientific Cloud

Citovat

OĽHA, Jaroslav, Jana HOZZOVÁ, Jan FOUSEK a Jiří FILIPOVIČ. Exploiting historical data: pruning autotuning spaces and estimating the number of tuning steps. In Ulrich Schwardmann, Christian Boehme, Dora B. Heras, Valeria Cardellini, Emmanuel Jeannot, Antonio Salis, Claudio Schifanella, Ravi Reddy Manumachu, Dieter Schwamborn, Laura Ricci, Oh Sangyoon, Thomas Gruber, Laura Antonelli, Stephen L. Scott. Lecture Notes in Computer Science. Cham, Switzerland: Springer, Cham, 2019, s. 295-307. ISBN 978-3-030-48339-5. Dostupné z: https://dx.doi.org/10.1007/978-3-030-48340-1_23.

@inproceedings{1551680,
   author = {Oľha, Jaroslav and Hozzová, Jana and Fousek, Jan and Filipovič, Jiří},
   address = {Cham, Switzerland},
   booktitle = {Lecture Notes in Computer Science},
   doi = {http://dx.doi.org/10.1007/978-3-030-48340-1_23},
   editor = {Ulrich Schwardmann, Christian Boehme, Dora B. Heras, Valeria Cardellini, Emmanuel Jeannot, Antonio Salis, Claudio Schifanella, Ravi Reddy Manumachu, Dieter Schwamborn, Laura Ricci, Oh Sangyoon, Thomas Gruber, Laura Antonelli, Stephen L. Scott},
   keywords = {Autotuning; prediction of tuning cost; tuning space pruning; sensitivity analysis},
   howpublished = {tištěná verze "print"},
   language = {eng},
   location = {Cham, Switzerland},
   isbn = {978-3-030-48339-5},
   pages = {295-307},
   publisher = {Springer, Cham},
   title = {Exploiting historical data: pruning autotuning spaces and estimating the number of tuning steps},
   year = {2019}
}

TY  - JOUR
ID  - 1551680
AU  - Oľha, Jaroslav - Hozzová, Jana - Fousek, Jan - Filipovič, Jiří
PY  - 2019
TI  - Exploiting historical data: pruning autotuning spaces and estimating the number of tuning steps
PB  - Springer, Cham
CY  - Cham, Switzerland
SN  - 9783030483395
KW  - Autotuning
KW  - prediction of tuning cost
KW  - tuning space pruning
KW  - sensitivity analysis
N2  - Autotuning, the practice of automatic tuning of code to provide performance portability, has received increased attention in the research community, especially in high performance computing. Ensuring high performance on a variety of hardware usually means modifications to the code, often via different values of a selected set of parameters, such as tiling size, loop unrolling factor or data layout. However, the search space of all possible combinations of these parameters can be enormous. Traditional search methods often fail to find a well-performing set of parameter values quickly. We have found that certain properties of tuning spaces do not vary much when hardware is changed. In this paper, we demonstrate that it is possible to use historical data to reliably predict the number of tuning steps necessary to find a well-performing configuration, and to reduce the size of the tuning space. We evaluate our hypotheses on a number of GPU-accelerated benchmarks written in CUDA and OpenCL.
ER  -

OĽHA, Jaroslav, Jana HOZZOVÁ, Jan FOUSEK a Jiří FILIPOVIČ. Exploiting historical data: pruning autotuning spaces and estimating the number of tuning steps. In Ulrich Schwardmann, Christian Boehme, Dora B. Heras, Valeria Cardellini, Emmanuel Jeannot, Antonio Salis, Claudio Schifanella, Ravi Reddy Manumachu, Dieter Schwamborn, Laura Ricci, Oh Sangyoon, Thomas Gruber, Laura Antonelli, Stephen L. Scott. \textit{Lecture Notes in Computer Science}. Cham, Switzerland: Springer, Cham, 2019, s.~295-307. ISBN~978-3-030-48339-5. Dostupné z: https://dx.doi.org/10.1007/978-3-030-48340-1\_{}23.

Podrobný výpis o publikaci