This paper describes the implementation of an hybrid OpenMP/MPI parallelization strategy in a Discontinuous Galerkin solver used for DNS and LES or CAA computations, to fruitfully exploit the modern massively parallel HPC facilities. It is usually believed that the sheared memory view of OpenMP can easily increase the parallel efficiency of codes dealing with multi-core clusters. The idea consists of running calculations on those machines restricting as much as possible the use of the MPI library to the communications between nodes and exploiting the shared memory paradigm within a node. However, in practice, the achievement of a real parallel performance gain is not straightforward. Moreover, as far as DG solvers are concerned, almost nothing is reported in the current literature about the hybrid MPI/OpenMP implementation. In this work a colouring algorithm has been employed for OpenMP. The resulting hybrid strategy performs quite satisfactory, since generally it is more efficient of the pure MPI implementation. However, the performances are heavily dependent on hardware platforms, as well as on computational details such as the polynomial order of space discretization or the number of computational elements. Several scalability tests have been performed, resulting in the conclusion that the best performance can be achieved only with a proper choice of the number of MPI partition and OpenMP threads to be used within a single node. The reliability of the method was here assessed by solving the Taylor Green vortex problem at Reynolds numbers equal to 800 and 1600 and the Linear Euler acustic scattering from a rigid sphere.
(2016). Hybrid OPENMP/MPI parallelization of a high-order Discontinuous Galerkin CFD/CAA solver [conference presentation - intervento a convegno]. Retrieved from http://hdl.handle.net/10446/76729
Hybrid OPENMP/MPI parallelization of a high-order Discontinuous Galerkin CFD/CAA solver
Bassi, Francesco;Colombo, Alessandro;
2016-01-01
Abstract
This paper describes the implementation of an hybrid OpenMP/MPI parallelization strategy in a Discontinuous Galerkin solver used for DNS and LES or CAA computations, to fruitfully exploit the modern massively parallel HPC facilities. It is usually believed that the sheared memory view of OpenMP can easily increase the parallel efficiency of codes dealing with multi-core clusters. The idea consists of running calculations on those machines restricting as much as possible the use of the MPI library to the communications between nodes and exploiting the shared memory paradigm within a node. However, in practice, the achievement of a real parallel performance gain is not straightforward. Moreover, as far as DG solvers are concerned, almost nothing is reported in the current literature about the hybrid MPI/OpenMP implementation. In this work a colouring algorithm has been employed for OpenMP. The resulting hybrid strategy performs quite satisfactory, since generally it is more efficient of the pure MPI implementation. However, the performances are heavily dependent on hardware platforms, as well as on computational details such as the polynomial order of space discretization or the number of computational elements. Several scalability tests have been performed, resulting in the conclusion that the best performance can be achieved only with a proper choice of the number of MPI partition and OpenMP threads to be used within a single node. The reliability of the method was here assessed by solving the Taylor Green vortex problem at Reynolds numbers equal to 800 and 1600 and the Linear Euler acustic scattering from a rigid sphere.File | Dimensione del file | Formato | |
---|---|---|---|
8104.pdf
Solo gestori di archivio
Versione:
publisher's version - versione editoriale
Licenza:
Licenza default Aisberg
Dimensione del file
6.18 MB
Formato
Adobe PDF
|
6.18 MB | Adobe PDF | Visualizza/Apri |
Pubblicazioni consigliate
Aisberg ©2008 Servizi bibliotecari, Università degli studi di Bergamo | Terms of use/Condizioni di utilizzo