Repository logo
Log in(current)
Repository logoMIT Open ScholarshipDSpace@MIT
  1. Home
  2. MIT Open Access Articles
  3. MIT Open Access Articles
  4. A Probabilistic Perspective on Tiling Sparse Tensor Algebra

A Probabilistic Perspective on Tiling Sparse Tensor Algebra

Thumbnail Image
Download
Name

3725843.3756095.pdf

Size

1.81 MB

Format

Adobe PDF

Checksum (MD5)

df6c1117ba5972e8b0506f913dc174fc

Download all files submitted through automated deposit
3725843.3756095.zip (1.53 MB)
Author(s)
Sharma, Ritvik
•
Xue, Zi Yu
•
Zhang, Nathan
•
Lacouture, Rubens
•
Kjolstad, Fredrik
•
Achour, Sara
•
Horowitz, Mark
Date Issued
October 17, 2025
Publisher
ACM|58th IEEE/ACM International Symposium on Microarchitecture
Citation
Ritvik Sharma, Zi Yu Xue, Nathan Zhang, Rubens Lacouture, Fredrik Kjolstad, Sara Achour, and Mark Horowitz. 2025. A Probabilistic Perspective on Tiling Sparse Tensor Algebra. In 58th IEEE/ACM International Symposium on Microarchitecture (MICRO ’25), October 18–22, 2025, Seoul, Republic of Korea. ACM, New York, NY, USA, 14 pages.
Version
Final published version
Abstract
Sparse tensor algebra computations are often memory-bound due to irregular access patterns and low arithmetic intensity. We present D2T2 (Data-Driven Tensor Tiling), a framework that optimizes static coordinate-space tiling schemes to minimize memory traffic by identifying and leveraging relevant high-level statistics from input operands. For a given tensor algebra computation, D2T2 collects statistics from input tensors, builds a probability distribution-based model of the tensor computation, and uses it to predict traffic for various tiling configurations. It searches over tile shape and size configurations to minimize total traffic. We evaluate D2T2 against Tailors and DRT, two state of the art tiling schemes for sparse tensor algebra. We find that D2T2 achieves, on average, a 2.54 × speedup over Tailors and a 1.13× lower memory bandwidth compared to DRT for sparse-sparse matrix multiplication (SpMSpM). We also achieve 1.22–48.94× lower bandwidth for SpMSpM and up to 34.31× lower bandwidth for tensor operations (TTM and MTTKRP) than conservative static tiling schemes. Unlike prior tiling techniques, D2T2 is deployable without specialized hardware support. On Opal, a 16nm sparse tensor algebra accelerator, D2T2 generated tiling configurations that achieve 1.23–3.34 × speedups compared to their original hand-tuned configurations.
Description
MICRO ’25, Seoul, Republic of Korea
MIT Department
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Terms of Use
Creative Commons Attribution
https://creativecommons.org/licenses/by/4.0/
Persistent DSpace Link
https://hdl.handle.net/1721.1/164078
DOI of Published Version
https://doi.org/10.1145/3725843.3756095
Repository logo
PrivacyPermissionsAccessibilityContact us
Repository logo
Notify us about copyright concerns.