Skip to Main content Skip to Navigation
Conference papers

Parallel Sparse PLUQ Factorization modulo p

Abstract : In this paper, we present the results of our experiments to compute the rank of several large sparse matrices from Dumas's Sparse Integer Matrix Collection, by computing sparse PLUQ factorizations. Our approach consists in identifying as many pivots as possible before performing any arithmetic operation, based solely on the location of non-zero entries in the input matrix. These " structural " pivots are then all eliminated in parallel, in a single pass. We describe several heuristic structural pivot selection algorithms (the problem is NP-hard). These algorithms allows us to compute the ranks of several large sparse matrices in a few minutes, versus many days using Wiedemann's algorithm. Lastly, we describe a multi-thread implementation using OpenMP achieving 70% parallel efficiency on 24 cores on the largest benchmark.
Complete list of metadata

Cited literature [30 references]  Display  Hide  Download
Contributor : Charles Bouillaguet Connect in order to contact the contributor
Submitted on : Tuesday, December 5, 2017 - 11:41:05 AM
Last modification on : Tuesday, January 18, 2022 - 5:07:14 PM


Files produced by the author(s)



Charles Bouillaguet, Claire Delaplace, Marie-Emilie Voge. Parallel Sparse PLUQ Factorization modulo p. PASCO'17, Jul 2017, Kaiserslautern, Germany. pp.1 - 10, ⟨10.1145/3115936.3115944⟩. ⟨hal-01646133⟩



Les métriques sont temporairement indisponibles