Abstract
In this paper we present methods for efficient parallelization of the solution of pressure Poisson equation arising in 3D CFD forest fire modeling. The solution procedure employs the Conjugate Gradient method with implicit Modified ILU (MILU) preconditioner. The basic idea for parallelizing recursive incomplete-decomposition algorithms is to use a direct nested twisted approach in combination with a staircase method. Parallelization of MILU-CG solver is implemented in OpenMP environment for Non-uniform memory (NuMA) computer systems. Performance results of the parallelized algorithm are presented and analyzed for different number of processors (up to 16). © 2009 Springer Berlin Heidelberg.
Cite
CITATION STYLE
Accary, G., Bessonov, O., Fougère, D., Gavrilov, K., Meradji, S., & Morvan, D. (2009). Efficient parallelization of the preconditioned conjugate gradient method. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5698 LNCS, pp. 60–72). https://doi.org/10.1007/978-3-642-03275-2_7
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
