skip to main content
OSTI.GOV title logo U.S. Department of Energy
Office of Scientific and Technical Information

Title: True Load Balancing for Matricized Tensor Times Khatri-Rao Product

Journal Article · · IEEE Transactions on Parallel and Distributed Systems
 [1];  [2];  [1]
  1. Bilkent Univ., Ankara (Turkey)
  2. Sandia National Lab. (SNL-NM), Albuquerque, NM (United States)

MTTKRP is the bottleneck operation in algorithms used to compute the CP tensor decomposition. For sparse tensors, utilizing the compressed sparse fibers (CSF) storage format and the CSF-oriented MTTKRP algorithms is important for both memory and computational efficiency on distributed-memory architectures. Existing intelligent tensor partitioning models assume the computational cost of MTTKRP to be proportional to the total number of nonzeros in the tensor. However, this is not the case for the CSF-oriented MTTKRP on distributed-memory architectures. We outline two deficiencies of nonzero-based intelligent partitioning models when CSF-oriented MTTKRP operations are performed locally: failure to encode processors' computational loads and increase in total computation due to fiber fragmentation. We focus on existing fine-grain hypergraph model and propose a novel vertex weighting scheme that enables this model encode correct computational loads of processors. We also propose to augment the fine-grain model by fiber nets for reducing the increase in total computational load via minimizing fiber fragmentation. In this way, the proposed model encodes minimizing the load of the bottleneck processor. In conclusion, parallel experiments with real-world sparse tensors on up to 1024 processors prove the validity of the outlined deficiencies and demonstrate the merit of our proposed improvements in terms of parallel runtimes.

Research Organization:
Sandia National Lab. (SNL-NM), Albuquerque, NM (United States)
Sponsoring Organization:
USDOE National Nuclear Security Administration (NNSA)
Grant/Contract Number:
AC04-94AL85000
OSTI ID:
1765777
Report Number(s):
SAND-2021-0767J; 693586
Journal Information:
IEEE Transactions on Parallel and Distributed Systems, Vol. 32, Issue 8; ISSN 1045-9219
Publisher:
IEEECopyright Statement
Country of Publication:
United States
Language:
English

Similar Records

Partitioning Models for Scaling Parallel Sparse Matrix-Matrix Multiplication
Journal Article · Wed Jan 03 00:00:00 EST 2018 · ACM Transactions on Parallel Computing · OSTI ID:1765777

Load-balanced sparse MTTKRP on GPUs
Conference · Mon Sep 02 00:00:00 EDT 2019 · OSTI ID:1765777

An Efficient Mixed-Mode Representation of Sparse Tensors
Conference · Sun Nov 17 00:00:00 EST 2019 · OSTI ID:1765777