Automatic Generation of Efficient Sparse Tensor Format Conversion Routines

Stephen Chou; Fredrik Kjolstad; Saman Amarasinghe

doi:10.1145/3385412.3385963

PLDI · June 2020

Automatic Generation of Efficient Sparse Tensor Format Conversion Routines

Stephen Chou Fredrik Kjolstad Saman Amarasinghe

ACM SIGPLAN Conference on Programming Language Design and Implementation

Read PDF DOI Video

Topics Sparse tensor algebra Data representations

Related software

TACO: The Tensor Algebra Compiler A compiler that generates fast kernels for tensor algebra expressions over dense and sparse tensors from a high-level index notation.

Cite this paper

BibTeX

@inproceedings{chou2020automatic,
  author    = {Chou, Stephen and Kjolstad, Fredrik and Amarasinghe, Saman},
  title     = {Automatic Generation of Efficient Sparse Tensor Format Conversion Routines},
  booktitle = {Proceedings of the 41st ACM SIGPLAN Conference on Programming Language Design and Implementation},
  year      = {2020},
  month     = jun,
  pages     = {823--838},
  publisher = {Association for Computing Machinery},
  address   = {New York, NY, USA},
  doi       = {10.1145/3385412.3385963},
  url       = {https://doi.org/10.1145/3385412.3385963}
}

Citation

Stephen Chou, Fredrik Kjolstad, and Saman Amarasinghe. Automatic Generation of Efficient Sparse Tensor Format Conversion Routines. PLDI, 2020.

All publications