Communication-optimal parallel and sequential QR and LU factorizations - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Article Dans Une Revue SIAM Journal on Scientific Computing Année : 2012

Communication-optimal parallel and sequential QR and LU factorizations

Résumé

We present parallel and sequential dense QR factorization algorithms that are both optimal (up to polylogarithmic factors) in the amount of communication they perform and just as stable as Householder QR. We prove optimality by deriving new lower bounds for the number of multiplications done by "non-Strassen-like" QR, and using these in known communication lower bounds that are proportional to the number of multiplications. We not only show that our QR algorithms attain these lower bounds (up to polylogarithmic factors), but that existing LAPACK and ScaLAPACK algorithms perform asymptotically more communication. We derive analogous communication lower bounds for LU factorization and point out recent LU algorithms in the literature that attain at least some of these lower bounds. The sequential and parallel QR algorithms for tall and skinny matrices lead to significant speedups in practice over some of the existing algorithms, including LAPACK and ScaLAPACK, for example, up to 6.7 times over ScaLAPACK. A performance model for the parallel algorithm for general rectangular matrices predicts significant speedups over ScaLAPACK.

Dates et versions

hal-00870930 , version 1 (08-10-2013)

Identifiants

Citer

James W. Demmel, Laura Grigori, Mark Hoemmen, Julien Langou. Communication-optimal parallel and sequential QR and LU factorizations. SIAM Journal on Scientific Computing, 2012, 34 (1), pp.206-239. ⟨10.1137/080731992⟩. ⟨hal-00870930⟩
158 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More