Score: 1

Accelerating Sparse MTTKRP for Small Tensor Decomposition on GPU

Published: March 23, 2025 | arXiv ID: 2503.18198v1

By: Sasindu Wijeratne, Rajgopal Kannan, Viktor Prasanna

Potential Business Impact:

Makes computers analyze big data much faster.

Business Areas:
GPU Hardware

Sparse Matricized Tensor Times Khatri-Rao Product (spMTTKRP) is the bottleneck kernel of sparse tensor decomposition. In tensor decomposition, spMTTKRP is performed iteratively along all the modes of an input tensor. In this work, we propose a mode-specific tensor layout on GPU that uses multiple tensor copies, where each copy is optimized for a specific mode. The proposed tensor layout increases the data locality of external memory accesses and eliminates the intermediate values communicated between the GPU thread blocks and the GPU global memory. We also propose a tensor partitioning scheme to optimally distribute the total computations among GPU streaming multiprocessors based on the sparsity and the dimensions of the input tensor. Our approach achieves a geometric mean speedup of 2.4x, 7.9x, and 8.9x in total execution time compared with the state-of-the-art GPU baselines.

Country of Origin
πŸ‡ΊπŸ‡Έ United States

Page Count
6 pages

Category
Computer Science:
Distributed, Parallel, and Cluster Computing