CIMEC   24726
CENTRO DE INVESTIGACION DE METODOS COMPUTACIONALES
Unidad Ejecutora - UE
artículos
Título:
Evaluating the performance of the particle finite element method in parallel architectures
Autor/es:
JUAN M. GIMENEZ; NORBERTO M. NIGRO; SERGIO R. IDELSOHN
Revista:
Computational Particle Mechanics
Editorial:
Springer
Referencias:
Año: 2014 vol. 1 p. 103 - 116
ISSN:
2196-4378
Resumen:
This paper presents a high performance implementation for the particle-mesh based method called particlefinite element method two (PFEM-2). It consists of a material derivative based formulation of the equationswith a hybrid spatial discretization which uses an Eulerian mesh and Lagrangian particles. The main aim ofPFEM-2 is to solve transport equations as fast as possible keeping some level of accuracy. The method wasfound to be competitive with classical Eulerian alternatives for these targets, even in their range of optimalapplication. To evaluate the goodness of the method with large simulations, it is imperative to use of parallelenvironments. Parallel strategies for Finite Element Method have been widely studied and many libraries canbe used to solve Eulerian stages of PFEM-2. However, Lagrangian stages, such as streamline integration,must be developed considering the parallel strategy selected. The main drawback of PFEM-2 is the largeamount of memory needed, which limits its application to large problems with only one computer. Therefore,a distributed-memory implementation is urgently needed. Unlike a shared-memory approach, using domaindecomposition the memory is automatically isolated, thus avoiding race conditions; however new issuesappear due to data distribution over the processes. Thus, a domain decomposition strategy for both particleand mesh is adopted, which minimizes the communication between processes. Finally, performance analysisrunning over multicore and multinode architectures are presented. The Courant?Friedrichs?Lewy numberused influences the efficiency of the parallelization and, in some cases, a weighted partitioning can be usedto improve the speed-up. However the total cputime for cases presented is lower than that obtained whenusing classical Eulerian strategies.