Using Mixed Precision for Sparse Matrix Computations to Enhance the Performance while Achieving 64-bit Accuracy - Archive ouverte HAL Access content directly
Journal Articles ACM Transactions on Mathematical Software Year : 2008

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

(1, 2) , (3) , (3) , (3) ,
1
2
3

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.

Dates and versions

hal-02421028 , version 1 (20-12-2019)

Identifiers

Cite

Alfredo Buttari, Jack J. 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, 2008, 34 (4), pp.1-22. ⟨10.1145/1377596.1377597⟩. ⟨hal-02421028⟩
43 View
0 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More