Sciweavers

Share
FGCS
2006

OpenMP versus MPI for PDE solvers based on regular sparse numerical operators

8 years 11 months ago
OpenMP versus MPI for PDE solvers based on regular sparse numerical operators
Tw o parallel programming models represented b y OpenMP and MPI are compared for PDE solvers based on regular sparse numerical operators. As a typical representative of such an application, the Euler equations for uid ow are considered. The comparison of programming models is made with regard to UMA, NUMA, and self optimizing NUMA (NUMA-opt) computer architectures. By NUMA-opt, we mean NUMA systems extended with self optimizations algorithms, in order to reduce the non-uniformity of the memory access time. The main conclusions of the study are: (1) that OpenMP is a viable alternativ e to MPI on UMA and NUMA-opt architectures, (2) that OpenMP is not competitive on NUMA platforms, unless special care is taken to get an initial data placement that matches the algorithm, and (3) that for OpenMP to be competitive in the NUMA-opt case, it is not necessary to extend the OpenMP model with additional data distribution directives, nor to include user-level access to the page migration library.
Markus Nordén, Sverker Holmgren, Michael Th
Added 12 Dec 2010
Updated 12 Dec 2010
Type Journal
Year 2006
Where FGCS
Authors Markus Nordén, Sverker Holmgren, Michael Thuné
Comments (0)
books