SparseLNR: Accelerating Sparse Tensor Computations Using Loop Nest Restructuring
Adhitha Dias, Kirshanthan Sundararajah, Charitha Saumya, Milind, Kulkarni

TL;DR
SparseLNR introduces loop nest restructuring techniques to optimize sparse tensor computations, significantly enhancing performance by supporting kernel distribution and loop fusion within the TACO compiler framework.
Contribution
It extends TACO's scheduling space with kernel distribution and loop fusion, enabling more efficient sparse tensor algebra code generation.
Findings
Performance improvements on real-world tensor computations
Enhanced data locality and reduced asymptotic complexity
Effective optimization of sparse tensor kernels
Abstract
Sparse tensor algebra computations have become important in many real-world applications like machine learning, scientific simulations, and data mining. Hence, automated code generation and performance optimizations for tensor algebra kernels are paramount. Recent advancements such as the Tensor Algebra Compiler (TACO) greatly generalize and automate the code generation for tensor algebra expressions. However, the code generated by TACO for many important tensor computations remains suboptimal due to the absence of a scheduling directive to support transformations such as distribution/fusion. This paper extends TACO's scheduling space to support kernel distribution/loop fusion in order to reduce asymptotic time complexity and improve locality of complex tensor algebra computations. We develop an intermediate representation (IR) for tensor operations called branched iteration graph…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
