Skip to Main content Skip to Navigation
Journal articles

Recursion based parallelization of exact dense linear algebra routines for Gaussian elimination

Jean-Guillaume Dumas 1 Thierry Gautier 2, 3 Clément Pernet 3, 4, 1 Jean-Louis Roch 3 Ziad Sultan 3, 1
2 AVALON - Algorithms and Software Architectures for Distributed and HPC Platforms
Inria Grenoble - Rhône-Alpes, LIP - Laboratoire de l'Informatique du Parallélisme
3 MOAIS - PrograMming and scheduling design fOr Applications in Interactive Simulation
Inria Grenoble - Rhône-Alpes, LIG - Laboratoire d'Informatique de Grenoble
4 ARIC - Arithmetic and Computing
Inria Grenoble - Rhône-Alpes, LIP - Laboratoire de l'Informatique du Parallélisme
Abstract : We present block algorithms and their implementation for the parallelization of sub-cubic Gaussian elimination on shared memory architectures. Contrarily to the classical cubic algorithms in parallel numerical linear algebra, we focus here on recursive algorithms and coarse grain parallelization. Indeed, sub-cubic matrix arithmetic can only be achieved through recursive algorithms making coarse grain block algorithms perform more efficiently than fine grain ones. This work is motivated by the design and implementation of dense linear algebra over a finite field, where fast matrix multiplication is used extensively and where costly modular reductions also advocate for coarse grain block decomposition. We incrementally build efficient kernels, for matrix multiplication first, then triangular system solving, on top of which a recursive PLUQ decomposition algorithm is built. We study the parallelization of these kernels using several algorithmic variants: either iterative or recursive and using different splitting strategies. Experiments show that recursive adaptive methods for matrix multiplication, hybrid recursive-iterative methods for triangular system solve and tile recursive versions of the PLUQ decomposition, together with various data mapping policies, provide the best performance on a 32 cores NUMA architecture. Overall, we show that the overhead of modular reductions is more than compensated by the fast linear algebra algorithms and that exact dense linear algebra matches the performance of full rank reference numerical software even in the presence of rank deficiencies.
Complete list of metadatas

Cited literature [29 references]  Display  Hide  Download
Contributor : Clément Pernet <>
Submitted on : Thursday, September 24, 2015 - 4:51:37 PM
Last modification on : Thursday, November 19, 2020 - 1:01:55 PM
Long-term archiving on: : Wednesday, April 26, 2017 - 6:32:37 PM


Files produced by the author(s)


Distributed under a Creative Commons Attribution 4.0 International License




Jean-Guillaume Dumas, Thierry Gautier, Clément Pernet, Jean-Louis Roch, Ziad Sultan. Recursion based parallelization of exact dense linear algebra routines for Gaussian elimination. Parallel Computing, Elsevier, 2016, 57, pp.235-249. ⟨10.1016/j.parco.2015.10.003⟩. ⟨hal-01084238v2⟩



Record views


Files downloads