Parallelized domain decomposition for multi-dimensional Lagrangian random walk mass-transfer particle tracking schemes
-
Published:2023-02-03
Issue:3
Volume:16
Page:833-849
-
ISSN:1991-9603
-
Container-title:Geoscientific Model Development
-
language:en
-
Short-container-title:Geosci. Model Dev.
Author:
Schauer Lucas, Schmidt Michael J., Engdahl Nicholas B.ORCID, Pankavich Stephen D., Benson David A., Bolster Diogo
Abstract
Abstract. Lagrangian particle tracking schemes allow a wide range of flow and transport processes to be simulated accurately, but a major challenge is numerically implementing the inter-particle interactions in an efficient manner. This article develops a multi-dimensional, parallelized domain decomposition (DDC) strategy for mass-transfer particle tracking (MTPT) methods in which particles exchange mass dynamically. We show that this can be efficiently parallelized by employing large numbers of CPU cores to accelerate run times. In order to validate the approach and our theoretical predictions we focus our efforts on a well-known benchmark problem with pure diffusion, where analytical solutions in any number of dimensions are well established. In this work, we investigate different procedures for “tiling” the domain in two and three dimensions (2-D and 3-D), as this type of formal DDC construction is currently limited to 1-D. An optimal tiling is prescribed based on physical problem parameters and the number of available CPU cores, as each tiling provides distinct results in both accuracy and run time. We further extend the most efficient technique to 3-D for comparison, leading to an analytical discussion of the effect of dimensionality on strategies for implementing DDC schemes. Increasing computational resources (cores) within the DDC method produces a trade-off between inter-node communication and on-node work.
For an optimally subdivided diffusion problem, the 2-D parallelized algorithm achieves nearly perfect linear speedup in comparison with the serial run-up to around 2700 cores, reducing a 5 h simulation to 8 s, while the 3-D algorithm maintains appreciable speedup up to 1700 cores.
Funder
National Science Foundation Army Research Laboratory
Publisher
Copernicus GmbH
Reference56 articles.
1. Aris, R.: On the dispersion of a solute in a fluid flowing through a tube,
P. Roy. Soc. Lond. A, 235, 67–77, 1956. a 2. Bear, J.: On the tensor form of dispersion in porous media, J.
Geophys. Res., 66, 1185–1197,
https://doi.org/10.1029/JZ066i004p01185, 1961. a 3. Bear, J.: Dynamics of Fluids in Porous Media, Dover Publications, ISSN
2212-778X, 1972. a 4. Beckingsale, D. A., Burmark, J., Hornung, R., Jones, H., Killian, W., Kunen,
A. J., Pearce, O., Robinson, P., Ryujin, B. S., and Scogland, T. R.: RAJA:
Portable Performance for Large-Scale Scientific Applications, in: 2019
IEEE/ACM International Workshop on Performance, Portability and Productivity
in HPC (P3HPC), 71–81, https://doi.org/10.1109/P3HPC49587.2019.00012, 2019. a 5. Benson, D. A. and Bolster, D.: Arbitrarily Complex Chemical Reactions on
Particles, Water Resour. Res., 52, 9190–9200,
https://doi.org/10.1002/2016WR019368, 2016. a, b
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
|
|