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

Kód výsledku v 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>

Výsledek na webu

<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>

Jazyk výsledku

angličtina

Název v původním jazyce

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

Popis výsledku v původním jazyce

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.

Název v anglickém jazyce

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

Popis výsledku anglicky

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.

Druh

J_imp - Článek v periodiku v databázi Web of Science

CEP obor

—

OECD FORD obor

10102 - Applied mathematics

Projekt

—

Návaznosti

I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace

Rok uplatnění

2024

Kód důvěrnosti údajů

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Název periodika

SIAM Journal on Scientific Computing

ISSN

1064-8275

e-ISSN

1095-7197

Svazek periodika

46

Číslo periodika v rámci svazku

6

Stát vydavatele periodika

US - Spojené státy americké

Počet stran výsledku

30

Strana od-do

"B830"-"B859"

Kód UT WoS článku

001415052200003

EID výsledku v databázi Scopus

—