Optimizing Sparse Tensor Compilation for Sparse Output
Sparse tensor algebra plays an important role in many scientific and engineering applications, yet existing sparse libraries and compilers face challenges when the output tensor is sparse. Array-based storage formats, such as CSR, require costly memory reallocations and rely on intermediate tensors (workspaces) to handle sparse scattering into the output, which limits performance and scalability. We introduce a new approach that employs our proposed flexible map-based storage format to directly support sparse scattering into the output without requiring extra workspaces. Our system then applies code and storage-specific optimizations. Experimental results across a range of kernels and datasets demonstrate an average speedup of $7.45\times$ over a state-of-the-art compiler and $5.29\times$ over a sparse tensor library.
Sat 31 JanDisplayed time zone: Hobart change
11:00 - 12:45 | |||
11:00 26mTalk | GraalMHC: ML-Based Method-Hotness Classification for Binary-Size Reduction in Optimizing Compilers Main Conference Milan Cugurovic Oracle and University of Belgrade, Aleksandar Prokopec Oracle Labs, Boris Spasojevic Oracle Labs, Zurich, Switzerland, Vojin Jovanovic Oracle Labs, Milena Vujosevic Janicic University of Belgrade and Oracle | ||
11:26 26mTalk | It’s about Time - Temporal Abstractions for Asynchronous GPU Tensor Computations Main Conference | ||
11:52 26mTalk | Optimizing Sparse Tensor Compilation for Sparse Output Main Conference Shideh Hashemian University of Edinburgh, Michael F. P. O'Boyle University of Edinburgh, Amir Shaikhha University of Edinburgh | ||
12:18 26mTalk | RIFS: Run-time Invariant Function Specialization Main Conference Saba Jamilan University of California, Santa Cruz, Snehasish Kumar Google LLC, Heiner Litz UC Santa Cruz | ||