Parallel mesh adaptation using parallel graph partitioning - Archive ouverte HAL Access content directly
Conference Papers Year : 2014

Parallel mesh adaptation using parallel graph partitioning

(1) , (1, 2) , (3, 1)
1
2
3

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.
Fichier principal
Vignette du fichier
pampa (1).pdf (898.3 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01099259 , version 1 (02-01-2015)

Identifiers

  • HAL Id : hal-01099259 , version 1

Cite

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⟩
219 View
196 Download

Share

Gmail Facebook Twitter LinkedIn More