Skip to Main content Skip to Navigation
Conference papers

Parallel computation of echelon forms

Jean-Guillaume Dumas 1 Thierry Gautier 2 Clément Pernet 2, 3 Ziad Sultan 2, 1
1 CASYS - Calculs Algébriques et Systèmes Dynamiques
LJK [2007-2015] - Laboratoire Jean Kuntzmann [2007-2015]
2 MOAIS - PrograMming and scheduling design fOr Applications in Interactive Simulation
Inria Grenoble - Rhône-Alpes, LIG [2007-2015] - Laboratoire d'Informatique de Grenoble [2007-2015]
3 ARIC - Arithmetic and Computing
Inria Grenoble - Rhône-Alpes, LIP - Laboratoire de l'Informatique du Parallélisme
Abstract : We propose efficient parallel algorithms and implementations on shared memory architectures of LU factorization over a finite field. Compared to the corresponding numerical routines, we have identified three main difficulties specific to linear algebra over finite fields. First, the arithmetic complexity could be dominated by modular reductions. Therefore, it is mandatory to delay as much as possible these reductions while mixing fine-grain parallelizations of tiled iterative and recursive algorithms. Second, fast linear algebra variants, e.g., using Strassen-Winograd algorithm, never suffer from instability and can thus be widely used in cascade with the classical algorithms. There, trade-offs are to be made between size of blocks well suited to those fast variants or to load and communication balancing. Third, many applications over finite fields require the rank profile of the matrix (quite often rank deficient) rather than the solution to a linear system. It is thus important to design parallel algorithms that preserve and compute this rank profile. Moreover, as the rank profile is only discovered during the algorithm, block size has then to be dynamic. We propose and compare several block decomposition: tile iterative with left-looking, right-looking and Crout variants, slab and tile recursive. Experiments demonstrate that the tile recursive variant performs better and matches the performance of reference numerical software when no rank deficiency occur. Furthermore, even in the most heterogeneous case, namely when all pivot blocks are rank deficient, we show that it is possbile to maintain a high efficiency.
Complete list of metadatas
Contributor : Jean-Guillaume Dumas <>
Submitted on : Friday, February 14, 2014 - 3:07:50 PM
Last modification on : Friday, July 17, 2020 - 11:39:00 AM
Long-term archiving on: : Thursday, May 15, 2014 - 10:41:49 AM


Files produced by the author(s)



Jean-Guillaume Dumas, Thierry Gautier, Clément Pernet, Ziad Sultan. Parallel computation of echelon forms. EuroPar-2014 - 20th International Conference on Parallel Processing, Aug 2014, Porto, Portugal. pp.499-510, ⟨10.1007/978-3-319-09873-9_42⟩. ⟨hal-00947013⟩



Record views


Files downloads