A shared memory parallel multi-mesh fast marching method for re-distancing
- 48 Downloads
A common problem arising in expanding front simulations is to restore the signed distance field property of a discretized domain (i.e., a mesh), by calculating the minimum distance of mesh points to an interface. This problem is referred to as re-distancing and a widely used method for its solution is the fast marching method (FMM). In many cases, a particular high accuracy in specific regions around the interface is required. There, meshes with a finer resolution are defined in the regions of interest, enabling the problem to be solved locally with a higher accuracy. Additionally, this gives rise to coarse-grained parallelization, as such meshes can be re-distanced in parallel. An efficient parallelization approach, however, has to deal with interface-sharing meshes, load-balancing issues, and must offer reasonable parallel efficiency for narrow band and full band re-distancing. We present a parallel multi-mesh FMM to tackle these challenges: Interface-sharing meshes are resolved using a synchronized data exchanges strategy. Parallelization is introduced by applying a pool of tasks concept, implemented using OpenMP tasks. Meshes are processed by OpenMP tasks as soon as threads become available, efficiently balancing out the computational load of unequally sized meshes over the entire computation. Our investigations cover parallel performance of full and narrow band re-distancing. The resulting algorithm shows a good parallel efficiency, if the problem consists of significantly more meshes than the available processor cores.
KeywordsFast marching method Shared memory parallelism Eikonal equation Re-distancing
Mathematics Subject Classification (2010)68W10 65Y05 65Y10 65Y20
Unable to display preview. Download preview PDF.
The financial support by the Austrian Federal Ministry for Digital and Economic Affairs and the National Foundation for Research, Technology and Development is gratefully acknowledged. The computational results presented have been achieved using the Vienna Scientific Cluster (VSC).
- 4.Diamantopoulos, G., Weinbub, J., Hössinger, A., Selberherr, S.: Evaluation of the shared-memory parallel fast marching method for re-distancing problems. In: Proceedings of the 17th International Conference on Computational Science and Its Applications (ICCSA), pp. 1–8. https://doi.org/10.1109/ICCSA.2017.7999648 (2017)
- 6.Herrmann, M.: A domain decomposition parallelization of the fast marching method. In: Anual Research Briefs, pp. 213–225. Center for Turbulence Research, Stanford University (2003)Google Scholar
- 8.Manstetten, P.: Efficient Flux Calculations for Topography Simulation. Ph.D. thesis, TU Wien (2018). http://www.iue.tuwien.ac.at/phd/manstetten/
- 10.Sethian, J.A.: Level Set Methods and Fast Marching Methods: Evolving Interfaces in Computational Geometry, Fluid Mechanics, Computer Vision, and Materials Science, 2nd edn. Cambridge University Press (1999)Google Scholar
- 12.Weinbub, J., Hössinger, A.: Shared-memory parallelization of the fast marching method using an overlapping domain-decomposition approach. In: Proceedings of the 24th High Performance Computing Symposium, pp. 18:1–18:8. https://doi.org/10.22360/SpringSim.2016.HPC.052 (2016)