Abstract

We present a framework for compiling recurrence equations into native code. In our framework, users specify a system of recurrences, the types of data structures that store inputs and outputs, and scheduling commands for optimization. Our compiler then lowers these specifications into native code that respects the dependencies in the recurrence equations. Our compiler can generate code over both sparse and dense data structures, and determines if the recurrence system is solvable with the provided scheduling primitives. We evaluate the performance and correctness of the generated code on several recurrences, from domains as diverse as dense and sparse matrix solvers, dynamic programming, graph problems, and sparse tensor algebra. We demonstrate that the generated code has competitive performance to hand-optimized implementations in libraries. However, these handwritten libraries target specific recurrences, specific data structures, and specific optimizations. Our system, on the other hand, automatically generates implementations from recurrences, data formats, and schedules, giving our system more generality than library approaches.

Article

pdf

BibTeX

@article{sundram2024,
  title={Compiling Recurrences over Dense and Sparse Arrays},
  author={Shiv Sundram and Muhammad Usman Tariq and Fredrik Kjolstad},
  journal={Proceedings of the ACM on Programming Languages},
  volume={8},
  issue={OOPSLA},
  year={2024},
  month={October}
}