2 citations · 6 across the 7 of their papers we have counts for
5 papers · 1 filter
Minimizing Communication for Parallel Symmetric Tensor Times Same Vector Computation
Hussam Al Daas, Grey Ballard, Laura Grigori +3
In this article, we focus on the parallel communication cost of multiplying the same vector along two modes of a -dimensional symmetric tensor. This is a key computation in the…
Communication Lower Bounds and Optimal Algorithms for Symmetric Matrix Computations
Hussam Al Daas, Grey Ballard, Laura Grigori +3
In this article, we focus on the communication costs of three symmetric matrix computations: i) multiplying a matrix with its transpose, known as a symmetric rank-k update (SYRK) i…
Tight Memory-Independent Parallel Matrix Multiplication Communication Lower Bounds
Hussam Al Daas, Grey Ballard, Laura Grigori +2
Communication lower bounds have long been established for matrix multiplication algorithms. However, most methods of asymptotic analysis have either ignored the constant factors or…
A 3D Parallel Algorithm for QR Decomposition
Grey Ballard, James Demmel, Laura Grigori +2
Interprocessor communication often dominates the runtime of large matrix computations. We present a parallel algorithm for computing QR decompositions whose bandwidth cost (communi…
Multilevel communication optimal LU and QR factorizations for hierarchical platforms
Laura Grigori, Mathias Jacquelin, Amal Khabou
This study focuses on the performance of two classical dense linear algebra algorithms, the LU and the QR factorizations, on multilevel hierarchical platforms. We first introduce a…