Format Abstraction for Sparse Tensor Algebra Compilers

Stephen Chou; Fredrik Kjolstad; Saman Amarasinghe

doi:10.1145/3276493

OOPSLA · October 2018

Format Abstraction for Sparse Tensor Algebra Compilers

Stephen Chou Fredrik Kjolstad Saman Amarasinghe

ACM SIGPLAN Conference on Object-Oriented Programming, Systems, Languages, and Applications · PACMPL vol. 2, OOPSLA

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

@article{chou2018format,
  author    = {Chou, Stephen and Kjolstad, Fredrik and Amarasinghe, Saman},
  title     = {Format Abstraction for Sparse Tensor Algebra Compilers},
  journal   = {Proceedings of the ACM on Programming Languages},
  year      = {2018},
  month     = oct,
  volume    = {2},
  number    = {OOPSLA},
  articleno = {123},
  numpages  = {30},
  publisher = {Association for Computing Machinery},
  address   = {New York, NY, USA},
  doi       = {10.1145/3276493},
  url       = {https://doi.org/10.1145/3276493}
}

Citation

Stephen Chou, Fredrik Kjolstad, and Saman Amarasinghe. Format Abstraction for Sparse Tensor Algebra Compilers. OOPSLA, 2018.

All publications