Skip to Main content Skip to Navigation
Journal articles

A study of shared-memory parallelism in a multifrontal solver

Abstract : We introduce shared-memory parallelism in a parallel distributed-memory solver, targeting multi-core architectures. Our concern in this paper is pure shared-memory parallelism, although the work will also impact distributed-memory parallelism. Our approach avoids a deep redesign and fully benefits from the numerical kernels and features of the original code. We use performance models to exploit coarse-grain parallelism in an OpenMP environment while, at the same time, also relying on third-party optimized multithreaded libraries. In this context, we propose simple approaches to take advantage of NUMA architectures, and original optimizations to limit thread synchronization costs. The performance gains are analyzed in detail on test problems from various application areas. Although the studied code is a direct solver for sparse systems of linear equations, the contributions of this paper are more general and could be useful in a wider range of situations.
Document type :
Journal articles
Complete list of metadata
Contributor : Equipe Roma Connect in order to contact the contributor
Submitted on : Wednesday, September 3, 2014 - 2:04:07 PM
Last modification on : Friday, September 30, 2022 - 4:12:07 AM



Jean-Yves L'Excellent, Wissam M. Sid-Lakhdar. A study of shared-memory parallelism in a multifrontal solver. Parallel Computing, Elsevier, 2014, 40 (3-4), pp.34-46. ⟨10.1016/j.parco.2014.02.003⟩. ⟨hal-01060322⟩



Record views