Technological Aspects of the Hybrid Parallelization with OpenMP and MPI

Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 10421)


In this paper we present practical parallelization techniques for different explicit and implicit numerical algorithms. These algorithms are considered on the base of the analysis of characteristics of modern computer systems and the nature of modeled physical processes. Limits of applicability of methods and parallelization techniques are determined in terms of practical implementation. Finally, the unified parallelization approach for OpenMP and MPI for solving a CFD problem in a regular domain is presented and discussed.


OpenMP Hybrid Parallelization Distributed Memory Computer System Twisted Factorization Unique Address Space 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.



This work was supported by the Russian Foundation for Basic Research (projects 15-01-06363, 15-01-02012). The work was granted access to the HPC resources of Aix-Marseille Université financed by the project Equip@Meso (ANR-10-EQPX-29-01) of the program Investissements d’Avenir supervised by the Agence Nationale pour la Recherche (France).


  1. 1.
    Bessonov, O.: OpenMP parallelization of a CFD code for multicore computers: analysis and comparison. In: Malyshkin, V. (ed.) PaCT 2011. LNCS, vol. 6873, pp. 13–22. Springer, Heidelberg (2011). doi: 10.1007/978-3-642-23178-0_2 CrossRefGoogle Scholar
  2. 2.
    Bessonov, O.: Highly parallel multigrid solvers for multicore and manycore processors. In: Malyshkin, V. (ed.) PaCT 2015. LNCS, vol. 9251, pp. 10–20. Springer, Cham (2015). doi: 10.1007/978-3-319-21909-7_2 CrossRefGoogle Scholar
  3. 3.
    Bessonov, O.: Parallelization properties of preconditioners for the conjugate gradient methods. In: Malyshkin, V. (ed.) PaCT 2013. LNCS, vol. 7979, pp. 26–36. Springer, Heidelberg (2013). doi: 10.1007/978-3-642-39958-9_3 CrossRefGoogle Scholar
  4. 4.
    Accary, G., Bessonov, O., Fougère, D., Gavrilov, K., Meradji, S., Morvan, D.: Efficient parallelization of the preconditioned conjugate gradient method. In: Malyshkin, V. (ed.) PaCT 2009. LNCS, vol. 5698, pp. 60–72. Springer, Heidelberg (2009). doi: 10.1007/978-3-642-03275-2_7 CrossRefGoogle Scholar
  5. 5.
    Saad, Y.: Iterative Methods for Sparse Linear Systems. PWS Publishing, Boston (2000)Google Scholar
  6. 6.
    Bastian, P., Horton, G.: Parallelization of robust multi-grid methods: ILU-factorization and frequency decomposition method. SIAM J. Stat. Comput. 12, 1457–1470 (1991)CrossRefzbMATHGoogle Scholar
  7. 7.
    Elizarova, T., Chetverushkin, B.: Implementation of multiprocessor transputer system for computer simulation of computational physics problems (in Russian). Math. Model. 4(11), 75–100 (1992)Google Scholar
  8. 8.
    Bessonov, O., Fedoseyev, A.: Parallelization of the preconditioned IDR solver for modern multicore computer systems. In: Application of Mathematics in Technical and Natural Sciences: 4th International Conference. AIP Conference Proceedings, vol. 1487, pp. 314–321 (2012)Google Scholar
  9. 9.
    Stüben, K.: A review of algebraic multigrid. J. Comput. Appl. Math. 128, 281–309 (2001)MathSciNetCrossRefzbMATHGoogle Scholar

Copyright information

© Springer International Publishing AG 2017

Authors and Affiliations

  1. 1.Institute for Problems in Mechanics of the Russian Academy of SciencesMoscowRussia

Personalised recommendations