Leveraging OpenMP Tasks for Efficient Parallel Modeling of the Elastic Eave Propagation in Multi-mesh Problems
This paper presents a new algorithm for parallelizing the grid-characteristic method in sharedmemory systems. The OpenMP task parallelism mechanism is used for parallelization. A modification of the grid-characteristic method is considered that uses a set of overlapped grids to determine a complex heterogeneous structure of the computational domain. The complexity of parallelizing the algorithm is represented by the presence of many different-sized grids. The proposed algorithm is described and compared with basic parallelization algorithms. Basic algorithms mean separate parallelization within each computational grid using the loop parallelization mechanism. An analysis of the efficiency of the post-doubling and parallel algorithms is performed. The advantage of the proposed algorithm for a number of problems is demonstrated. The results of testing and calculating the propagation of wave disturbances in a fractured layer are presented. Each crack in the example is specified by a separate computational grid, which significantly increases the multi-scale problem and the number of computational grids. Work is underway to transfer the algorithm to the three-dimensional case.
Institutions
- Moscow Institute of Physics and Technology (RU)
- Kurchatov Institute (RU)
Publication Details
- Journal
- Supercomputing Frontiers and Innovations
- Published
- 2024-11-01
- DOI
- https://doi.org/10.14529/jsfi240407
- Primary Topic
- Computational Geometry and Mesh Generation
- Type
- article
- Field-Weighted Citation Impact
- 0.00
Funders
- National Research Center "Kurchatov Institute"