Fine-Grained Multithreading for the Multifrontal QR Factorization of Sparse Matrices

Abstract : The advent of multicore processors represents a disruptive event in the history of computer science as conventional parallel programming paradigms are proving incapable of fully exploiting their potential for concurrent computations. The need for different or new programming models clearly arises from recent studies which identify fine-granularity and dynamic execution as the keys to achieving high efficiency on multicore systems. This work presents an approach to the parallelization of the multifrontal method for the $QR$ factorization of sparse matrices specifically designed for multicore based systems. High efficiency is achieved through a fine-grained partitioning of data and a dynamic scheduling of computational tasks relying on a dataflow parallel programming model. Experimental results show that an implementation of the proposed approach achieves higher performance and better scalability than existing equivalent software.
Liste complète des métadonnées

https://hal.archives-ouvertes.fr/hal-01122471
Contributor : Open Archive Toulouse Archive Ouverte (oatao) <>
Submitted on : Wednesday, March 4, 2015 - 8:06:21 AM
Last modification on : Friday, April 12, 2019 - 4:23:01 PM
Document(s) archivé(s) le : Friday, June 5, 2015 - 10:16:10 AM

File

Buttari_12707.pdf
Files produced by the author(s)

Identifiers

Collections

Citation

Alfredo Buttari. Fine-Grained Multithreading for the Multifrontal QR Factorization of Sparse Matrices. SIAM Journal on Scientific Computing, Society for Industrial and Applied Mathematics, 2013, vol. 35 (n° 4), pp. 323-345. ⟨10.1137/110846427⟩. ⟨hal-01122471⟩

Share

Metrics

Record views

85

Files downloads

111