A 3D Parallel Algorithm for QR Decomposition - Inria - Institut national de recherche en sciences et technologies du numérique
Communication Dans Un Congrès Année : 2018

A 3D Parallel Algorithm for QR Decomposition

Résumé

Interprocessor communication often dominates the runtime of large matrix computations. We present a parallel algorithm for computing QR decompositions whose bandwidth cost (communication volume) can be decreased at the cost of increasing its latency cost (number of messages). By varying a parameter to navigate the bandwidth/latency tradeoff, we can tune this algorithm for machines with different communication costs.
Fichier non déposé

Dates et versions

hal-01968376 , version 1 (02-01-2019)

Identifiants

  • HAL Id : hal-01968376 , version 1

Citer

Grey Ballard, James W. Demmel, Laura Grigori, Mathias Jacquelin, Nicholas Knight. A 3D Parallel Algorithm for QR Decomposition. SPAA '18 - 30th ACM Symposium on Parallelism in Algorithms and Architectures, Jul 2018, Vienna, Austria. ⟨hal-01968376⟩
66 Consultations
0 Téléchargements

Partager

More