All

What are you looking for?

All
Projects
Results
Organizations

Quick search

  • Projects supported by TA ČR
  • Excellent projects
  • Projects with the highest public support
  • Current projects

Smart search

  • That is how I find a specific +word
  • That is how I leave the -word out of the results
  • “That is how I can find the whole phrase”

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

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216224%3A14610%2F20%3A00116267" target="_blank" >RIV/00216224:14610/20:00116267 - isvavai.cz</a>

  • Result on the web

    <a href="https://onlinelibrary.wiley.com/doi/10.1002/cpe.5962" target="_blank" >https://onlinelibrary.wiley.com/doi/10.1002/cpe.5962</a>

  • DOI - Digital Object Identifier

    <a href="http://dx.doi.org/10.1002/cpe.5962" target="_blank" >10.1002/cpe.5962</a>

Alternative languages

  • Result language

    angličtina

  • Original language name

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

  • Original language description

    Autotuning, the practice of automatic tuning of applications 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 large, which can result in cases where the benefits of autotuning are outweighed by its cost, especially with dynamic tuning. Therefore, estimating the tuning time in advance or shortening the tuning time is very important in dynamic tuning applications. We have found that certain properties of tuning spaces do not vary much when hardware is changed. In this article, we demonstrate that it is possible to use historical data to reliably predict the number of tuning steps that is necessary to find a well-performing configuration and to reduce the size of the tuning space. We evaluate our hypotheses on a number of HPC benchmarks written in CUDA and OpenCL, using several different generations of GPUs and CPUs.

  • 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

    Result was created during the realization of more than one project. More information in the Projects tab.

  • Continuities

    P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Others

  • Publication year

    2020

  • 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

    CONCURRENCY AND COMPUTATION-PRACTICE & EXPERIENCE

  • ISSN

    1532-0626

  • e-ISSN

  • Volume of the periodical

    32

  • Issue of the periodical within the volume

    21

  • Country of publishing house

    US - UNITED STATES

  • Number of pages

    15

  • Pages from-to

    1-15

  • UT code for WoS article

    000557422400001

  • EID of the result in the Scopus database

    2-s2.0-85089146702