124 citations · 315 across the 19 of their papers we have counts for
6 papers · 1 filter
An Asymptotic Cost Model for Autoscheduling Sparse Tensor Programs
Willow Ahrens, Fredrik Kjolstad, Saman Amarasinghe
While loop reordering and fusion can make big impacts on the constant-factor performance of dense tensor programs, the effects on sparse tensor programs are asymptotic, often leadi…
An Attempt to Generate Code for Symmetric Tensor Computations
Jessica Shi, Stephen Chou, Fredrik Kjolstad +1
This document describes an attempt to develop a compiler-based approach for computations with symmetric tensors. Given a computation and the symmetries of its input tensors, we der…
Automatic Generation of Efficient Sparse Tensor Format Conversion Routines
Stephen Chou, Fredrik Kjolstad, Saman Amarasinghe
This paper shows how to generate code that efficiently converts sparse tensors between disparate storage formats (data layouts) such as CSR, DIA, ELL, and many others. We decompose…
A Unified Iteration Space Transformation Framework for Sparse and Dense Tensor Algebra
Ryan Senanayake, Fredrik Kjolstad, Changwan Hong +2
We address the problem of optimizing mixed sparse and dense tensor algebra in a compiler. We show that standard loop transformations, such as strip-mining, tiling, collapsing, para…
Format Abstraction for Sparse Tensor Algebra Compilers
Stephen Chou, Fredrik Kjolstad, Saman Amarasinghe
This paper shows how to build a sparse tensor algebra compiler that is agnostic to tensor formats (data layouts). We develop an interface that describes formats in terms of their c…
Sparse Tensor Algebra Optimizations with Workspaces
Fredrik Kjolstad, Willow Ahrens, Shoaib Kamil +1
This paper shows how to optimize sparse tensor algebraic expressions by introducing temporary tensors, called workspaces, into the resulting loop nests. We develop a new intermedia…