GentenMPI: Distributed Memory Sparse Tensor Decomposition

Technical Report · Sat Aug 01 04:00:00 EDT 2020

DOI:https://doi.org/10.2172/1656940· OSTI ID:1656940

Devine, Karen D. ^[1]; Ballard, Grey ^[1]

---

1. Sandia National Laboratories (SNL), Albuquerque, NM, and Livermore, CA (United States)

GentenMPl is a toolkit of sparse canonical polyadic (CP) tensor decomposition algorithms that is designed to run effectively on distributed-memory high-performance computers. Its use of distributed-memory parallelism enables it to efficiently decompose tensors that are too large for a single compute node's memory. GentenMPl leverages Sandia's decades-long investment in the Trilinos solver framework for much of its parallel-computation capability. Trilinos contains numerical algorithms and linear algebra classes that have been optimized for parallel simulation of complex physical phenomena. This work applies these tools to the data science problem of sparse tensor decomposition. In this report, we describe the use of Trilinos in GentenMPl, extensions needed for sparse tensor decomposition, and implementations of the CP-ALS (CP via alternating least squares) and GCP-SGD (generalized CP via stochastic gradient descent) sparse tensor decomposition algorithms. We show that GentenMPl can decompose sparse tensors of extreme size, e.g., a 12.6-terabyte tensor on 8192 computer cores. We demonstrate that the Trilinos backbone provides good strong and weak scaling of the tensor decomposition algorithms.

• Research Organization: Sandia National Laboratories (SNL-NM), Albuquerque, NM (United States)
• Sponsoring Organization: USDOE National Nuclear Security Administration (NNSA)
• DOE Contract Number: AC04-94AL85000; NA0003525
• OSTI ID: 1656940
• Report Number(s): SAND--2020-8515; 690118
• Country of Publication: United States
• Language: English

Related Subjects

97 MATHEMATICS AND COMPUTING