A Unified Optimization Approach for Sparse Tensor Operations on GPUs

• Published in: 2017 IEEE International Conference on Cluster Computing (CLUSTER) pp. 47 - 57
• Main Authors: Bangtian Liu, Chengyao Wen, Sarwate, Anand D., Dehnavi, Maryam Mehri
• Format: Conference Proceeding
• Language: English
• Published: IEEE 01.09.2017
• Subjects: Acceleration; GPU; Graphics processing units; Matrix decomposition; Optimization; Parallel algorithms; Parallel Computing; Sparse matrices; Sparse Tensor Operations; Tensile stress; Unified Apprpach
• ISSN: 2168-9253
• DOI: 10.1109/CLUSTER.2017.75

Sparse tensors appear in many large-scale applications with multidimensional and sparse data. While multidimensional sparse data often need to be processed on manycore processors, attempts to develop highly-optimized GPU-based implementations of sparse tensor operations are rare. The irregular computation patterns and sparsity structures as well as the large memory footprints of sparse tensor operations make such implementations challenging. We leverage the fact that sparse tensor operations share similar computation patterns to propose a unified tensor representation called F-COO. Combined with GPU-specific optimizations, F-COO provides highly-optimized implementations of sparse tensor computations on GPUs. The performance of the proposed unified approach is demonstrated for tensor-based kernels such as the Sparse Matricized Tensor-Times-Khatri-Rao Product (SpMTTKRP) and the Sparse Tensor-Times-Matrix Multiply (SpTTM) and is used in tensor decomposition algorithms. Compared to state-of-the-art work we improve the performance of SpTTM and SpMTTKRP up to 3.7 and 30.6 times respectively on NVIDIA Titan-X GPUs. We implement a CANDECOMP/PARAFAC (CP) decomposition and achieve up to 14.9 times speedup using the unified method over state-of-the-art libraries on NVIDIA Titan-X GPUs.