Compiling Recurrences over Dense and Sparse Arrays

Shiv Sundram; Muhammad Usman Tariq; Fredrik Kjolstad

doi:10.1145/3649820

OOPSLA · April 2024

Compiling Recurrences over Dense and Sparse Arrays

Shiv Sundram Muhammad Usman Tariq Fredrik Kjolstad

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

Read PDF DOI

Topics Recurrences Sparse & structured arrays

Related software

RECUMA: The Recurrence Computation Machine A compiler that lowers user-specified systems of recurrence equations, with data-structure and scheduling directives, into imperative C loops over dense and sparse arrays.

Cite this paper

BibTeX

@article{sundram2024compiling,
  author    = {Sundram, Shiv and Tariq, Muhammad Usman and Kjolstad, Fredrik},
  title     = {Compiling Recurrences over Dense and Sparse Arrays},
  journal   = {Proceedings of the ACM on Programming Languages},
  year      = {2024},
  month     = apr,
  volume    = {8},
  number    = {OOPSLA1},
  articleno = {103},
  numpages  = {26},
  publisher = {Association for Computing Machinery},
  address   = {New York, NY, USA},
  doi       = {10.1145/3649820},
  url       = {https://doi.org/10.1145/3649820},
  keywords  = {recurrences, sparse tensor algebra, linear algebra, dynamic programming}
}

Citation

Shiv Sundram, Muhammad Usman Tariq, and Fredrik Kjolstad. Compiling Recurrences over Dense and Sparse Arrays. OOPSLA, 2024.

All publications