A High Performance Sparse Tensor Algebra Compiler in MLIR

Conference · Mon Dec 20 04:00:00 EST 2021

DOI:https://doi.org/10.1109/LLVMHPC54804.2021.00009· OSTI ID:1855960

Tian, Ruiqin ^[1]; Guo, Luanzheng ^[1]; Li, Jiajia ^[1]; Ren, Bin ^[2]; Kestor, Gokcen ^[1]

---

1. BATTELLE (PACIFIC NW LAB)
2. College of William and Mary in Virginia

Sparse tensor algebra is widely used in many applications, including scientific computing, machine learning, and data analytics. The performance of sparse tensor algebra kernels strongly depends on the intrinsic characteristics of the input tensors, hence many storage formats are designed for tensors to achieve optimal performance for particular applications/architectures, which makes it challenging to implement and optimize every tensor operation of interest on a given architecture. We propose a tensor algebra domain-specific language (DSL) and compiler framework to automatically generate kernels for mixed sparse-dense tensor algebra operations. The proposed DSL provides high-level programming abstractions that resemble the familiar Einstein notation to represent tensor algebra operations. The compiler introduces a new Sparse Tensor Algebra dialect built on top of LLVM's extensible MLIR compiler infrastructure for efficient code generation while covering a wide range of tensor storage formats. Our compiler also leverages input-dependent code optimization to enhance data locality for better performance. Our results show that the performance of automatically generated kernels outperforms the state-of-the-art sparse tensor algebra compiler, with up to 20.92x, 6.39x, and 13.9x performance improvement over state-of-the-art tensor algebra compilers, for parallel SpMV, SpMM, and TTM, respectively.

• Research Organization: Pacific Northwest National Laboratory (PNNL), Richland, WA (United States)
• Sponsoring Organization: USDOE
• DOE Contract Number: AC05-76RL01830
• OSTI ID: 1855960
• Report Number(s): PNNL-SA-168094
• Country of Publication: United States
• Language: English