To read this content please select one of the options below:

Parallel algorithms for moving boundary problems by local remeshing

Lisha He (Center for Engineering and Scientific Computation, and School of Aeronautics and Astronautics, Zhejiang University, Hangzhou, China)
Jianjing Zheng (Center for Hypergravity Experimental and Interdisciplinary Research, Zhejiang University, Hangzhou, China)
Yao Zheng (Center for Engineering and Scientific Computation, and School of Aeronautics and Astronautics, Zhejiang University, Hangzhou, China)
Jianjun Chen (Center for Engineering and Scientific Computation, and School of Aeronautics and Astronautics, Zhejiang University, Hangzhou, China)
Xuan Zhou (Institute of Applied Physics and Computational Mathematics, Beijing, China)
Zhoufang Xiao (School of Computer Science and Technology, Hangzhou Dianzi University, Hangzhou, China)

Engineering Computations

ISSN: 0264-4401

Article publication date: 3 October 2019

Issue publication date: 15 October 2019

282

Abstract

Purpose

The purpose of this paper is to develop parallel algorithms for moving boundary simulations by local remeshing and compose them to a fully parallel simulation cycle for the solution of problems with engineering interests.

Design/methodology/approach

The moving boundary problems are solved by unsteady flow computations coupled with six-degrees-of-freedom equations of rigid body motion. Parallel algorithms are developed for both computational fluid dynamics (CFD) solution and grid deformation steps. Meanwhile, a novel approach is developed for the parallelization of the local remeshing step. It inputs a distributed mesh after deformation, then marks low-quality elements to be deleted on the respective processors. After that, a parallel domain decomposition approach is used to repartition the hole mesh and then to redistribute the resulting sub-meshes onto all available processors. Then remesh individual sub-holes in parallel. Finally, the element redistribution is rebalanced.

Findings

If the CFD solver is parallelized while the remaining steps are executed in sequential, the performance bottleneck of such a simulation cycle is observed when the simulation of large-scale problem is executed. The developed parallel simulation cycle, in which all of time-consuming steps have been efficiently parallelized, could overcome these bottlenecks, in terms of both memory consumption and computing efficiency.

Originality/value

A fully parallel approach for moving boundary simulations by local remeshing is developed to solve large-scale problems. In the algorithm level, a novel parallel local remeshing algorithm is present. It repartitions distributed hole elements evenly onto all available processors and ensures the generation of a well-shaped inter-hole boundary always. Therefore, the subsequent remeshing step can fix the inter-hole boundary involves no communications.

Keywords

Acknowledgements

The authors appreciate the joint support for this project by Science Challenge Project of China (No. TZ2016002), Zhejiang Provincial Natural Science Foundation (Grant Nos. LR16F020002), the National Natural Science Foundation of China (Grant Nos. 11432013, U1630121, 61802099) and the Fundamental Research Funds for the Central Universities (No. 2019QNA4034).

Citation

He, L., Zheng, J., Zheng, Y., Chen, J., Zhou, X. and Xiao, Z. (2019), "Parallel algorithms for moving boundary problems by local remeshing", Engineering Computations, Vol. 36 No. 8, pp. 2887-2910. https://doi.org/10.1108/EC-11-2018-0545

Publisher

:

Emerald Publishing Limited

Copyright © 2019, Emerald Publishing Limited

Related articles