Implicit domain decomposition parallelization for the reconstruction of the level set function by the fast marching method

被引：0
|
作者：
Huang X. [1 ,2 ]
Xia B. [1 ,2 ]
Cheng Y. [1 ,2 ]
Jiang S. [1 ,2 ]
机构：
[1] School of Hydraulic Engineering, Changsha University of Science and Technology, Changsha
[2] Key Laboratory of Water-Sediment Sciences and Water Disaster Prevention of Hu'nan Province, Changsha University of Science and Technology, Changsha
来源：
Harbin Gongcheng Daxue Xuebao/Journal of Harbin Engineering University | 2020年 / 41卷 / 03期
关键词：
Domain decomposition; Fast marching; Implicit domain decomposition; Level set function; Parallelization; Reconstruction; Shared memory; Speedup ratio;
D O I：
10.11990/jheu.201812043
中图分类号：
学科分类号：
摘要：
To futher raise the shared-memory-based parallelization efficienty for reconstruction of level set function, an algorithm based on implicit domain decomposition is introduced. This method only separates the interface in advance rather than decomposing the domain beforehand and enables parallel fast marching reconstruction synchronized with domain decomposition. On the basis of the results of fast marching parallel reconstruction of isosurfaces, e.g., sphere, Zalesak's sphere, and dumbbell, the runtime of the implicit domain decomposition method is shorter than that of the explicit partitioning method. Moreover, the speedup ratio of the implicit method is nearly similar to that of the explicit method, in which the speedup ratio of the implicit method can reach 4 under eight threads. Furthermore, the number of re-evolution operations of nodes in the implicit domain decomposition method is smaller than that of the rollback operations of nodes in the explicit method. © 2020, Editorial Department of Journal of HEU. All right reserved.
引用
收藏
页码：441 / 447
页数：6
相关论文
共 27 条
  • [11] JIANG Liang, LIU Fengbin, CHEN Darong, A fast particle level set method with optimized particle correction procedure for interface capturing, Journal of computational physics, 299, pp. 804-819, (2015)
  • [12] MIRZADEH M, GUITTET A, BURSTEDDE C, Et al., Parallel level-set methods on adaptive tree-based grids, Journal of computational physics, 322, pp. 345-364, (2016)
  • [13] SETHIAN J A., Fast marching methods, SIAM review, 41, 2, pp. 199-235, (1999)
  • [14] CHOPP D L., Some improvements of the fast marching method, SIAM journal on scientific computing, 23, 1, pp. 230-244, (2001)
  • [15] HASSOUNA M S, FARAG A A., Multistencils fast marching methods: a highly accurate solution to the Eikonal equation on Cartesian domains, IEEE transactions on pattern analysis and machine intelligence, 29, 9, pp. 1563-1574, (2007)
  • [16] RICHARD TSAI Y H, CHENG L T, OSHER S, Et al., Fast sweeping algorithms for a class of Hamilton-Jacobi equations, SIAM journal on numerical analysis, 41, 2, pp. 673-694, (2003)
  • [17] QIAN Jianliang, ZHANG Yongtao, ZHAO Hongkai, Fast sweeping methods for Eikonal equations on triangular meshes, SIAM journal on numerical analysis, 45, 1, pp. 83-107, (2007)
  • [18] LI Fengyan, SHU Chiwang, ZHANG Yongtao, Et al., A second order discontinuous Galerkin fast sweeping method for Eikonal equations, Journal of computational physics, 227, 17, pp. 8191-8208, (2008)
  • [19] GREMAUD P A, KUSTER C M., Computational study of fast methods for the Eikonal equation, SIAM journal on scientific computing, 27, 6, pp. 1803-1816, (2006)
  • [20] HERRMANN M., A domain decomposition parallelization of the fast marching method, pp. 253-261, (2003)
123