A 3D Parallel Algorithm for QR Decomposition - Archive ouverte HAL Access content directly
Conference Papers Year :

A 3D Parallel Algorithm for QR Decomposition

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


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.
Not file

Dates and versions

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


  • HAL Id : hal-01968376 , version 1


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⟩
49 View
0 Download


Gmail Facebook Twitter LinkedIn More