Using Mixed Precision for Sparse Matrix Computations to Enhance the Performance while Achieving 64-bit Accuracy

Alfredo Buttari 1 Jack Dongarra 2 Jakub Kurzak 2 Piotr Luszczek 2 Stanimir Tomov
1 IRIT - Institut de recherche en informatique de Toulouse
2 ICL - Innovative Computing Laboratory [Knoxville]
Abstract : By using a combination of 32-bit and 64-bit floating point arithmetic, the performance of many sparse linear algebra algorithms can be significantly enhanced while maintaining the 64-bit accuracy of the resulting solution. These ideas can be applied to sparse multifrontal and supernodal direct techniques and sparse iterative techniques such as Krylov subspace methods. The approach presented here can apply not only to conventional processors but also to exotic technologies such as Field Programmable Gate Arrays (FPGA), Graphical Processing Units (GPU), and the Cell BE processor.
Document type :
Journal articles
Complete list of metadatas
https://hal.archives-ouvertes.fr/hal-02421028
Contributor : Alfredo Buttari <>
Submitted on : Friday, December 20, 2019 - 11:23:47 AM
Last modification on : Friday, January 10, 2020 - 9:09:27 PM

Links full text

openaccess

Identifiers

Collections

UNIV-TLSE3 | UT1-CAPITOLE | SMS | UNIV-TLSE2 | CNRS

Citation

Alfredo Buttari, Jack Dongarra, Jakub Kurzak, Piotr Luszczek, Stanimir Tomov. Using Mixed Precision for Sparse Matrix Computations to Enhance the Performance while Achieving 64-bit Accuracy. ACM Transactions on Mathematical Software, Association for Computing Machinery, 2008, 34 (4), pp.1-22. ⟨10.1145/1377596.1377597⟩. ⟨hal-02421028⟩

Export

BibTeX TEI DC DCterms EndNote

Share

Metrics

Record views

20

Contact

Informations

CCSD