282 citations · 955 across the 31 of their papers we have counts for
34 papers
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…
Sequential and Shared-Memory Parallel Algorithms for Partitioned Local Depths
Aditya Devarakonda, Grey Ballard
In this work, we design, analyze, and optimize sequential and shared-memory parallel algorithms for partitioned local depths (PaLD). Given a set of data points and pairwise distanc…
Parallel Randomized Tucker Decomposition Algorithms
Rachel Minster, Zitong Li, Grey Ballard
The Tucker tensor decomposition is a natural extension of the singular value decomposition (SVD) to multiway data. We propose to accelerate Tucker tensor decomposition algorithms b…
Communication Lower Bounds and Optimal Algorithms for Multiple Tensor-Times-Matrix Computation
Hussam Al Daas, Grey Ballard, Laura Grigori +2
Multiple Tensor-Times-Matrix (Multi-TTM) is a key computation in algorithms for computing and operating with the Tucker tensor decomposition, which is frequently used in multidimen…
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…