Generating Optimized Sparse Matrix Vector Product over Finite Fields

Pascal Giorgi 1 Bastien Vialla 1
1 ECO - Exact Computing
LIRMM - Laboratoire d'Informatique de Robotique et de Microélectronique de Montpellier
Abstract : Sparse Matrix Vector multiplication (SpMV) is one of the most important operation for exact sparse linear algebra. A lot of research has been done by the numerical community to provide efficient sparse matrix formats. However, when computing over finite fields, one need to deal with multi-precision values and more complex operations. In order to provide highly efficient SpMV kernel over finite field, we propose a code generation tool that uses heuristics to automatically choose the underlying matrix representation and the corresponding arithmetic.
Document type :
Conference papers
Complete list of metadatas

Cited literature [9 references]  Display  Hide  Download

https://hal-lirmm.ccsd.cnrs.fr/lirmm-01275818
Contributor : Pascal Giorgi <>
Submitted on : Thursday, February 18, 2016 - 11:36:37 AM
Last modification on : Wednesday, February 13, 2019 - 5:58:02 PM
Long-term archiving on : Thursday, May 19, 2016 - 10:33:02 AM

File

icms2014-giovia.pdf
Files produced by the author(s)

Identifiers

Collections

Citation

Pascal Giorgi, Bastien Vialla. Generating Optimized Sparse Matrix Vector Product over Finite Fields. ICMS: International Congress on Mathematical Software, Aug 2014, Séoul, South Korea. pp.685-690, ⟨10.1007/978-3-662-44199-2_102⟩. ⟨lirmm-01275818⟩

Share

Metrics

Record views

160

Files downloads

311