Communication Lower Bounds and Optimal Algorithms for Multiple Tensor-Times-Matrix Computation - Archive ouverte HAL Access content directly
Preprints, Working Papers, ... Year : 2022

Communication Lower Bounds and Optimal Algorithms for Multiple Tensor-Times-Matrix Computation

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

Abstract

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 multidimensional data analysis. We establish communication lower bounds that determine how much data movement is required to perform the Multi-TTM computation in parallel. The crux of the proof relies on analytically solving a constrained, nonlinear optimization problem. We also present a parallel algorithm to perform this computation that organizes the processors into a logical grid with twice as many modes as the input tensor. We show that with correct choices of grid dimensions, the communication cost of the algorithm attains the lower bounds and is therefore communication optimal. Finally, we show that our algorithm can significantly reduce communication compared to the straightforward approach of expressing the computation as a sequence of tensor-times-matrix operations.
Fichier principal
Vignette du fichier
multi-TTM.pdf (627.61 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-03950359 , version 1 (21-01-2023)

Identifiers

Cite

Hussam Al Daas, Grey Ballard, Laura Grigori, Suraj Kumar, Kathryn Rouse. Communication Lower Bounds and Optimal Algorithms for Multiple Tensor-Times-Matrix Computation. 2023. ⟨hal-03950359⟩
0 View
0 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More