SPLATT: Efficient and Parallel Sparse Tensor-Matrix Multiplication

Citations Over TimeTop 10% of 2015 papers

Abstract

Multi-dimensional arrays, or tensors, are increasingly found in fields such as signal processing and recommender systems. Real-world tensors can be enormous in size and often very sparse. There is a need for efficient, high-performance tools capable of processing the massive sparse tensors of today and the future. This paper introduces SPLATT, a C library with shared-memory parallelism for three-mode tensors. SPLATT contains algorithmic improvements over competing state of the art tools for sparse tensor factorization. SPLATT has a fast, parallel method of multiplying a matricide tensor by a Khatri-Rao product, which is a key kernel in tensor factorization methods. SPLATT uses a novel data structure that exploits the sparsity patterns of tensors. This data structure has a small memory footprint similar to competing methods and allows for the computational improvements featured in our work. We also present a method of finding cache-friendly reordering and utilizing them with a novel form of cache tiling. To our knowledge, this is the first work to investigate reordering and cache tiling in this context. SPLATT averages almost 30x speedup compared to our baseline when using 16 threads and reaches over 80x speedup on NELL-2.

Related Papers

• → Adaptive sparse tiling for sparse matrix multiplication(2019)157 cited
• → Sparse Matrix Multiplication On An Associative Processor(2014)35 cited
• → Efficient Tiled Sparse Matrix Multiplication through Matrix Signatures(2020)18 cited
• → SpMacho - Optimizing Sparse Linear Algebra Expressions with Probabilistic Density Estimation(2015)7 cited
• → Blocking Techniques for Sparse Matrix Multiplication on Tensor Accelerators(2022)1 cited