Comparison of Implicit and Explicit Parallel Programming Models for a Finite Element Simulation Algorithm
暂无分享,去创建一个
In this paper we compare efficiency of two versions of a parallel algorithm for finite element compressible fluid flow simulations on unstructued grids. The first version is based on the explicit model of parallel programming (with message-passing paradigm), while the second incorporates the implicit model (in which data-parallel programming is used). Time discretization of the compressible Euler equations is organized with a linear, implicit version of the Taylor-Galerkin time scheme, while finite elements are employed for space discretization of one step problems. The resulting nonsymmetric system of linear equations is solved iteratively with the preconditioned GMRES method.
[1] P. Woodward,et al. The numerical simulation of two-dimensional fluid flow with strong shocks , 1984 .
[2] J. Donea. A Taylor–Galerkin method for convective transport problems , 1983 .
[3] Graham F. Carey,et al. PARALLEL COMPUTATION OF VISCOUS FLOWS , 1997 .
[4] E. Sturler,et al. Communication Cost Reduction for Krylov Methods on Parallel Computers , 1994, HPCN.
[5] Y. Saad,et al. GMRES: a generalized minimal residual algorithm for solving nonsymmetric linear systems , 1986 .