Skip to Main content Skip to Navigation
Conference papers

Parallel mesh adaptation using parallel graph partitioning

Abstract : This paper presents a parallel remeshing algorithm for distributed-memory architectures. It is an iterative parallel algorithm that divides the areas to be remeshed into multiple pieces which can be distributed to as many processing elements as pos-sible, in order for these pieces to be remeshed concurrently by a third-party sequential remesher. Then, remeshed pieces are reintegrated into the distributed mesh, and this pro-cess is iterated until all relevant areas of the mesh have been remeshed. Any sequential remesher can be used, provided it allows some of the mesh elements not to be modified, so as to preserve interfaces between pieces. Our method, which has been implemented in the PaMPA library, is validated by a set of experiments involving both isotropic and anisotropic meshes.
Complete list of metadatas

Cited literature [22 references]  Display  Hide  Download

https://hal.inria.fr/hal-01099259
Contributor : François Pellegrini <>
Submitted on : Friday, January 2, 2015 - 12:29:12 AM
Last modification on : Thursday, January 11, 2018 - 6:22:35 AM
Long-term archiving on: : Friday, September 11, 2015 - 9:55:36 PM

File

pampa (1).pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-01099259, version 1

Collections

Citation

C Lachat, C Dobrzynski, F Pellegrini. Parallel mesh adaptation using parallel graph partitioning. 5th European Conference on Computational Mechanics (ECCM V), IACM & ECCOMAS, Jul 2014, Barcelone, Spain. pp.2612-2623. ⟨hal-01099259⟩

Share

Metrics

Record views

303

Files downloads

324