A 3D Parallel Algorithm for QR Decomposition
05/14/2018 
0
share
∙
by Grey Ballard, et al. ∙
Wake Forest University
∙
Inria
∙
NYU college
∙
berkeley college
∙
Berkeley Lab
∙
0
∙
share
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.
READ FULL TEXT
