Parallel Unstructured Grid Partition Algorithm Based on Charm

The finite element method (FEM) based on unstructured grid has been widely used in science and engineering. Charm++ programming has the advantages of task over-decomposition, asynchronous call communication and dynamic load, and is very suitable for parallelization of finite element methods which is...

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	2019 IEEE International Conference on Computational Electromagnetics (ICCEM) s. 1 - 3
Hlavní autori:	Wang, Ting, Chi, Xuebin, Zhao, Lian, Jiang, Jinrong, Wang, Wu, Li, Yongming
Médium:	Konferenčný príspevok..
Jazyk:	English
Vydavateľské údaje:	IEEE 01.03.2019
Predmet:	Charm Computer networks Finite element analysis Mathematical model METIS Parallel algorithms parallel programming system Partitioning algorithms Sorting Testing unstructured grid
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Popis
Shrnutí:	The finite element method (FEM) based on unstructured grid has been widely used in science and engineering. Charm++ programming has the advantages of task over-decomposition, asynchronous call communication and dynamic load, and is very suitable for parallelization of finite element methods which is unstructured grid discrete. This paper designed the Charm++ parallel algorithm of unstructured grid partition based on METIS (serial graph partitioning and fill-reducing matrix ordering). We implement the preprocessing communication modules use adding virtual boundary elements in order to minimize the amount the data for communication. Using insertion sorting and local-to-global element information can ensure the consistency of element id between serial and parallel program. The parallel grid partition can support FEM with unstructured grid in scientific and engineering applications. The testing shows that the partition algorithm is accurate and efficient.
DOI:	10.1109/COMPEM.2019.8779106