Repository logo
Log in(current)
Repository logoMIT Open ScholarshipDSpace@MIT
  1. Home
  2. MIT Open Access Articles
  3. MIT Open Access Articles
  4. TeAAL: A Declarative Framework for Modeling Sparse Tensor Accelerators

TeAAL: A Declarative Framework for Modeling Sparse Tensor Accelerators

Thumbnail Image
Download
Name

3613424.3623791.pdf

Size

2.54 MB

Format

Adobe PDF

Checksum (MD5)

871bfa5e10df0a700723932eb574bc07

Download all files submitted through automated deposit
3613424.3623791.zip (2.23 MB)
Author(s)
Nayak, Nandeeka
•
Odemuyiwa, Toluwanimi O.
•
Ugare, Shubham
•
Fletcher, Christopher
•
Pellauer, Michael
•
Emer, Joel
Date Issued
October 28, 2023
Publisher
ACM|56th Annual IEEE/ACM International Symposium on Microarchitecture
Citation
Nayak, Nandeeka, Odemuyiwa, Toluwanimi O., Ugare, Shubham, Fletcher, Christopher, Pellauer, Michael et al. 2023. "TeAAL: A Declarative Framework for Modeling Sparse Tensor Accelerators."
Version
Final published version
Abstract
Over the past few years, the explosion in sparse tensor algebra workloads has led to a corresponding rise in domain-specific accelerators to service them. Due to the irregularity present in sparse tensors, these accelerators employ a wide variety of novel solutions to achieve good performance. At the same time, prior work on design-flexible sparse accelerator modeling does not express this full range of design features, making it difficult to understand the impact of each design choice and compare or extend the state-of-the-art.To address this, we propose TeAAL: a language and simulator generator for the concise and precise specification and evaluation of sparse tensor algebra accelerators. We use TeAAL to represent and evaluate four disparate state-of-the-art accelerators—ExTensor, Gamma, OuterSPACE, and SIGMA—and verify that it reproduces their performance with high accuracy. Finally, we demonstrate the potential of TeAAL as a tool for designing new accelerators by showing how it can be used to speed up vertex-centric programming accelerators—achieving 1.9 × on BFS and 1.2 × on SSSP over GraphDynS.
MIT Department
Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory
Terms of Use
Article is made available in accordance with the publisher's policy and may be subject to US copyright law. Please refer to the publisher's site for terms of use.
Persistent DSpace Link
https://hdl.handle.net/1721.1/153258
DOI of Published Version
https://doi.org/10.1145/3613424.3623791
Repository logo
PrivacyPermissionsAccessibilityContact us
Repository logo
Notify us about copyright concerns.