Premium
SAFT: Shotgun advancing front technique for massively parallel mesh generation on graphics processing unit
Author(s) -
Zhou Qingyi,
Wang Qiqi,
Yu Zongfu
Publication year - 2022
Publication title -
international journal for numerical methods in engineering
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.421
H-Index - 168
eISSN - 1097-0207
pISSN - 0029-5981
DOI - 10.1002/nme.7038
Subject(s) - computer science , cuda , parallel computing , massively parallel , scalability , polygon mesh , domain decomposition methods , graphics processing unit , computational science , thread (computing) , computer graphics (images) , operating system , finite element method , engineering , structural engineering
Large‐scale numerical simulations need efficient parallel mesh generation schemes. Several parallel advancing front algorithms were proposed in the past decades, most of which require domain decomposition. In this article, we present a shotgun algorithm for parallel advancing front mesh generation. Our algorithm is front‐based, therefore does not require domain decomposition. We've implemented the algorithm on GPU, which has thousands of CUDA cores. Different from traditional volume‐based parallelization, each CUDA thread handles one face at a time. We deal with conflicts by discarding illegal new elements which intersect with each other. We name this proposed method “SAFT”, which stands for “shotgun advancing front technique”. Its performance, as well as scalability, has been evaluated on a laptop equipped with one NVIDIA Geforce RTX2060 graphics card. We have been able to generate high‐quality 2D meshes efficiently ( ≈ $$ \approx $$ 233k elements per second).