Efficient and Scalable Initialization of Partitioned Coupled Simulations with preCICE
Gardado en:
| Publicado en: | Algorithms vol. 14, no. 6 (2021), p. 166 |
|---|---|
| Autor Principal: | |
| Outros autores: | , , |
| Publicado: |
MDPI AG
|
| Materias: | |
| Acceso en liña: | Citation/Abstract Full Text + Graphics Full Text - PDF |
| Etiquetas: |
Sen Etiquetas, Sexa o primeiro en etiquetar este rexistro!
|
MARC
| LEADER | 00000nab a2200000uu 4500 | ||
|---|---|---|---|
| 001 | 2544558326 | ||
| 003 | UK-CbPIL | ||
| 022 | |a 1999-4893 | ||
| 024 | 7 | |a 10.3390/a14060166 |2 doi | |
| 035 | |a 2544558326 | ||
| 045 | 2 | |b d20210101 |b d20211231 | |
| 084 | |a 231333 |2 nlm | ||
| 100 | 1 | |a Amin Totounferoush |u Institute for Parallel and Distributed Systems (IPVS), University of Stuttgart, 70569 Stuttgart, Germany; <email>benjamin.uekermann@ipvs.uni-stuttgart.de</email> (B.U.); <email>miriam.schulte@ipvs.uni-stuttgart.de</email> (M.S.) | |
| 245 | 1 | |a Efficient and Scalable Initialization of Partitioned Coupled Simulations with preCICE | |
| 260 | |b MDPI AG |c 2021 | ||
| 513 | |a Journal Article | ||
| 520 | 3 | |a preCICE is an open-source library, that provides comprehensive functionality to couple independent parallelized solver codes to establish a partitioned multi-physics multi-code simulation environment. For data communication between the respective executables at runtime, it implements a peer-to-peer concept, which renders the computational cost of the coupling per time step negligible compared to the typical run time of the coupled codes. To initialize the peer-to-peer coupling, the mesh partitions of the respective solvers need to be compared to determine the point-to-point communication channels between the processes of both codes. This initialization effort can become a limiting factor, if we either reach memory limits or if we have to re-initialize communication relations in every time step. In this contribution, we remove two remaining bottlenecks: (i) We base the neighborhood search between mesh entities of two solvers on a tree data structure to avoid quadratic complexity, and (ii) we replace the sequential gather-scatter comparison of both mesh partitions by a two-level approach that first compares bounding boxes around mesh partitions in a sequential manner, subsequently establishes pairwise communication between processes of the two solvers, and finally compares mesh partitions between connected processes in parallel. We show, that the two-level initialization method is fives times faster than the old one-level scheme on 24,567 CPU-cores using a mesh with 628,898 vertices. In addition, the two-level scheme is able to handle much larger computational meshes, since the central mesh communication of the one-level scheme is replaced with a fully point-to-point mesh communication scheme. | |
| 653 | |a Parallel processing | ||
| 653 | |a Finite element method | ||
| 653 | |a Simulation | ||
| 653 | |a Software | ||
| 653 | |a Communication channels | ||
| 653 | |a Physics | ||
| 653 | |a Apexes | ||
| 653 | |a Turbulence models | ||
| 653 | |a Fluid-structure interaction | ||
| 653 | |a Data structures | ||
| 653 | |a Data communication | ||
| 653 | |a Decomposition | ||
| 653 | |a Computing costs | ||
| 653 | |a Numerical analysis | ||
| 653 | |a Solvers | ||
| 653 | |a Boxes | ||
| 653 | |a Codes | ||
| 653 | |a Algorithms | ||
| 653 | |a Libraries | ||
| 653 | |a Coupling | ||
| 700 | 1 | |a Simonis, Frédéric |u Scientific Computing in Computer Science, Technical University of Munich (TUM), 85748 Garching, Germany; <email>simonis@in.tum.de</email> | |
| 700 | 1 | |a Uekermann, Benjamin |u Institute for Parallel and Distributed Systems (IPVS), University of Stuttgart, 70569 Stuttgart, Germany; <email>benjamin.uekermann@ipvs.uni-stuttgart.de</email> (B.U.); <email>miriam.schulte@ipvs.uni-stuttgart.de</email> (M.S.) | |
| 700 | 1 | |a Schulte, Miriam |u Institute for Parallel and Distributed Systems (IPVS), University of Stuttgart, 70569 Stuttgart, Germany; <email>benjamin.uekermann@ipvs.uni-stuttgart.de</email> (B.U.); <email>miriam.schulte@ipvs.uni-stuttgart.de</email> (M.S.) | |
| 773 | 0 | |t Algorithms |g vol. 14, no. 6 (2021), p. 166 | |
| 786 | 0 | |d ProQuest |t Engineering Database | |
| 856 | 4 | 1 | |3 Citation/Abstract |u https://www.proquest.com/docview/2544558326/abstract/embedded/L8HZQI7Z43R0LA5T?source=fedsrch |
| 856 | 4 | 0 | |3 Full Text + Graphics |u https://www.proquest.com/docview/2544558326/fulltextwithgraphics/embedded/L8HZQI7Z43R0LA5T?source=fedsrch |
| 856 | 4 | 0 | |3 Full Text - PDF |u https://www.proquest.com/docview/2544558326/fulltextPDF/embedded/L8HZQI7Z43R0LA5T?source=fedsrch |