Skip to Main content Skip to Navigation
Reports

Introduction of shared-memory parallelism in a distributed-memory multifrontal solver

Abstract : We study the adaptation of a parallel distributed-memory solver towards a shared-memory code, targeting multi-core architectures. The advantage of adapting the code over a new design is to fully benefit from its numerical kernels, range of functionalities and internal features. Although the studied code is a direct solver for sparse systems of linear equations, the approaches described in this paper are general and could be useful to a wide range of applications. We show how existing parallel algorithms can be adapted to an OpenMP environment while, at the same time, also relying on third-party optimized multithreaded libraries. We propose simple approaches to take advantage of NUMA architectures, and original optimizations to limit thread synchronization costs. For each point, the performance gains are analyzed in detail on test problems from various application areas.
Complete list of metadatas

Cited literature [35 references]  Display  Hide  Download

https://hal.inria.fr/hal-00786055
Contributor : Jean-Yves l'Excellent <>
Submitted on : Tuesday, February 12, 2013 - 1:42:05 PM
Last modification on : Wednesday, November 20, 2019 - 2:29:32 AM
Long-term archiving on: : Monday, May 13, 2013 - 4:10:02 AM

File

RR-8227.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-00786055, version 1

Collections

Citation

Jean-Yves l'Excellent, Mohamed W. Sid-Lakhdar. Introduction of shared-memory parallelism in a distributed-memory multifrontal solver. [Research Report] RR-8227, INRIA. 2013, pp.35. ⟨hal-00786055⟩

Share

Metrics

Record views

477

Files downloads

1033