In this paper, we present new partitioning algorithms for unstructured meshes that prevent conflicts during parallel assembly of FEM matrices and vectors in shared memory. The algorithms use a criterion that determines if any two mesh cells are neighboring. This neighborhood criterion is used to partition the mesh into layers, which are then combined into blocks and assigned to different parallel processes/threads. The proposed partitioning algorithms are compared with the existing algorithms on quasi-structured and unstructured meshes by the number of potential conflicts and by the load imbalance.
CITATION STYLE
Novikov, A., Piminova, N., Kopysov, S., & Sagdeeva, Y. (2016). Layer-by-layer partitioning of finite element meshes for multicore architectures. In Communications in Computer and Information Science (Vol. 687, pp. 106–117). Springer Verlag. https://doi.org/10.1007/978-3-319-55669-7_9
Mendeley helps you to discover research relevant for your work.