A Novel Adaptive Match Scheme for Parallel Mesh-decomposition in OpenFOAM
(0) A parallel multilevel k-way partitioning algorithm is used in OpenFOAM to perform parallel mesh-decomposition.Before the parallel decomposition procedure,mesh has to be pre-decomposed by the Simple method in OpenFOAM.Match-computation for the algorithms parallel coarsening phase is based on a kind of global match scheme which introduces large amount of communication overhead.However,the domains of the mesh generated by Simple maintain good locality and continuity,which makes it unnecessary to adopt global match scheme in the parallel coarsening phase.In this paper,a novel adaptive match scheme AMS is brought forward for the parallel multilevel k-way partitioning algorithm.An adaptive critical x is calculated firstly according to the scale of the mesh and the parallel degree.For the first x stages of the coarsening phase,a local match scheme is adopted in which vertexes are only allowed to match with their adjacent unmatched vertexes with heaviest edge-weight on their local processors.For the rest stages,the traditional global match scheme is introduced and match of two vertexes on different processors is allowed.AMS can efficiently reduce the communication overhead introduced by simply adopting global match scheme.The experiment is performed on mesh of LinearPTT application on Tianhe-1A.The results show that the parallel multilevel k-way paritioning algorithm based on AMS has a better performance than that based on traditional global match scheme.
parallel graph-partitioning mesh-decomposition OpenFOAM adaptive match scheme
Miao Wang Yuhua Tang Hongyun Zhang
State Key Laboratory of High Performance Computing, National University of Defense Technology, Chang School of Computer, National University of Defense Technology, Changsha, 410073, China
国际会议
太原
英文
672-675
2012-12-08（万方平台首次上网日期，不代表论文的发表时间）