Efficient parallel resolution of the simplified transport equations in mixed-dual formulation

JOURNAL OF COMPUTATIONAL PHYSICS

卷:230

Article

Barrault, M.¹  Lathuiliere, B.¹  Ramet, P.²  Roman, J.³ 

[1] Dept SINETICS, EDF R&D, Clamart, France

[2] CNRS, INRIA Bordeaux Sud Quest, PRES Bordeaux, LaBRI,UMR 5800,Equipe Projet Bacchus, F-75700 Paris, France

[3] CNRS, INRIA Bordeaux Sud Quest, PRES Bordeaux, LaBRI,UMR 5800,Equipe Projet HiePACS, F-75700 Paris, France

关键词: Simplified transport equation;    Raviart-Thomas finite element;    HPC;    Parallelism;    Domain decomposition method;   

DOI  :  10.1016/j.jcp.2010.11.047

来源: Elsevier

【 摘 要 】

A reactivity computation consists of computing the highest eigenvalue of a generalized eigenvalue problem, for which an inverse power algorithm is commonly used. Very fine modelizations are difficult to treat for our sequential solver, based on the simplified transport equations, in terms of memory consumption and computational time. A first implementation of a Lagrangian based domain decomposition method brings to a poor parallel efficiency because of an increase in the power iterations [1]. In order to obtain a high parallel efficiency, we improve the parallelization scheme by changing the location of the loop over the subdomains in the overall algorithm and by benefiting from the characteristics of the Raviart-Thomas finite element. The new parallel algorithm still allows us to locally adapt the numerical scheme (mesh, finite element order). However, it can be significantly optimized for the matching grid case. The good behavior of the new parallelization scheme is demonstrated for the matching grid case on several hundreds of nodes for computations based on a pin-by-pin discretization. (C) 2010 Elsevier Inc. All rights reserved.

【 授权许可】

Free