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”

Biologically inspired algorithms applied in automatic tuning of parallel solver parameters for fast execution times

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F61989100%3A27740%2F24%3A10255017" target="_blank" >RIV/61989100:27740/24:10255017 - isvavai.cz</a>

  • Result on the web

    <a href="https://pubs.aip.org/aip/acp/article/3094/1/500015/3297255/Biologically-inspired-algorithms-applied-in" target="_blank" >https://pubs.aip.org/aip/acp/article/3094/1/500015/3297255/Biologically-inspired-algorithms-applied-in</a>

  • DOI - Digital Object Identifier

    <a href="http://dx.doi.org/10.1063/5.0210563" target="_blank" >10.1063/5.0210563</a>

Alternative languages

  • Result language

    angličtina

  • Original language name

    Biologically inspired algorithms applied in automatic tuning of parallel solver parameters for fast execution times

  • Original language description

    In this paper, we present a way how to automatically find and set an optimal configuration for a linear system solver during a transient analysis in order to reduce computation time. Our approach is based on biologically inspired algorithms which are able to find a reasonable configuration in tens of trials, i.e., tens of timesteps in terminology of the transient analysis. This work shows a measurement within which we compared several optimization algorithms and explored their time overhead. We focus on parallel multiphysical solvers for engineering simulations developed for high-performance computing. Our experiment includes one such solver based on Finite Element Tearing and Interconnection and 4 test cases, but our solution is modular, thus, it can be connected to other similar solvers.

  • Czech name

  • Czech description

Classification

  • Type

    D - Article in proceedings

  • CEP classification

  • OECD FORD branch

    10200 - Computer and information sciences

Result continuities

  • Project

  • Continuities

Others

  • Publication year

    2024

  • 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

  • Article name in the collection

    AIP Conference Proceedings. Volume 3094

  • ISBN

    978-0-7354-4954-1

  • ISSN

    0094-243X

  • e-ISSN

    1551-7616

  • Number of pages

    4

  • Pages from-to

    '500015-1'-'500015-4'

  • Publisher name

    AIP Publishing

  • Place of publication

    Melville

  • Event location

    Herákleion

  • Event date

    Sep 19, 2022

  • Type of event by nationality

    WRD - Celosvětová akce

  • UT code for WoS article