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”

EFFICIENT N-TO-M CHECKPOINTING ALGORITHM FOR FINITE ELEMENT SIMULATIONS

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F61989100%3A27240%2F24%3A10257408" target="_blank" >RIV/61989100:27240/24:10257408 - isvavai.cz</a>

  • Result on the web

    <a href="https://www.webofscience.com/wos/woscc/full-record/WOS:001415052200003" target="_blank" >https://www.webofscience.com/wos/woscc/full-record/WOS:001415052200003</a>

  • DOI - Digital Object Identifier

    <a href="http://dx.doi.org/10.1137/23M1613724" target="_blank" >10.1137/23M1613724</a>

Alternative languages

  • Result language

    angličtina

  • Original language name

    EFFICIENT N-TO-M CHECKPOINTING ALGORITHM FOR FINITE ELEMENT SIMULATIONS

  • Original language description

    In this work, we introduce a new algorithm for N-to-M checkpointing in finite element simulations. This new algorithm allows efficient saving/loading of functions representing physical quantities associated with the mesh representing the physical domain. Specifically, the algorithm allows for using different numbers of parallel processes for saving and loading, allowing for restarting and postprocessing on the process count appropriate to the given phase of the simulation and other conditions. For demonstration, we implemented this algorithm in PETSc, the Portable, Extensible Toolkit for Scientific Computation, and added a convenient high-level interface into Firedrake, a system for solving partial differential equations using finite element methods. We evaluated our new implementation by saving and loading data involving 8.2 billion finite element degrees of freedom using 8,192 parallel processes on ARCHER2, the UK National Supercomputing Service.

  • 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

    10102 - Applied mathematics

Result continuities

  • Project

  • Continuities

    I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace

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

  • Name of the periodical

    SIAM Journal on Scientific Computing

  • ISSN

    1064-8275

  • e-ISSN

    1095-7197

  • Volume of the periodical

    46

  • Issue of the periodical within the volume

    6

  • Country of publishing house

    US - UNITED STATES

  • Number of pages

    30

  • Pages from-to

    "B830"-"B859"

  • UT code for WoS article

    001415052200003

  • EID of the result in the Scopus database