Efficient N-to-M Checkpointing Algorithm for Finite Element Simulations
Fuente:
arXiv
Saved in:
| Main Authors: | , , , , |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866918224903274496 |
|---|---|
| author | Ham, David A. Hapla, Vaclav Knepley, Matthew G. Mitchell, Lawrence Sagiyama, Koki |
| author_facet | Ham, David A. Hapla, Vaclav Knepley, Matthew G. Mitchell, Lawrence Sagiyama, Koki |
| contents | 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 post-processing 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2401_05868 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Efficient N-to-M Checkpointing Algorithm for Finite Element Simulations Ham, David A. Hapla, Vaclav Knepley, Matthew G. Mitchell, Lawrence Sagiyama, Koki Distributed, Parallel, and Cluster Computing Mathematical Software 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 post-processing 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. |
| title | Efficient N-to-M Checkpointing Algorithm for Finite Element Simulations |
| topic | Distributed, Parallel, and Cluster Computing Mathematical Software |
| url | https://arxiv.org/abs/2401.05868 |