activity
20182024
most citedFormat Abstraction for Sparse Tensor Algebra Compilers

124 citations · 315 across the 19 of their papers we have counts for

collaborators
Showing cs.PLShow all

9 papers · 1 filter

cs.PL2024

Compilation of Modular and General Sparse Workspaces

Genghan Zhang, Olivia Hsu, Fredrik Kjolstad

Recent years have seen considerable work on compiling sparse tensor algebra expressions. This paper addresses a shortcoming in that work, namely how to generate efficient code (in…

cs.PL2023

Compiling Recurrences over Dense and Sparse Arrays

Shiv Sundram, Muhammad Usman Tariq, Fredrik Kjolstad

Recurrence equations lie at the heart of many computational paradigms including dynamic programming, graph analysis, and linear solvers. These equations are often expensive to comp…

cs.PL2022

BaCO: A Fast and Portable Bayesian Compiler Optimization Framework

Erik Hellsten, Artur Souza, Johannes Lenfers +7

We introduce the Bayesian Compiler Optimization framework (BaCO), a general purpose autotuner for modern compilers targeting CPUs, GPUs, and FPGAs. BaCO provides the flexibility ne…

cs.PL2022★ 4 cited

Stardust: Compiling Sparse Tensor Algebra to a Reconfigurable Dataflow Architecture

Olivia Hsu, Alexander Rucker, Tian Zhao +2

We introduce Stardust, a compiler that compiles sparse tensor algebra to reconfigurable dataflow architectures (RDAs). Stardust introduces new user-provided data representation and…

cs.PL2022

Looplets: A Language For Structured Coiteration

Willow Ahrens, Daniel Donenfeld, Fredrik Kjolstad +1

Real world arrays often contain underlying structure, such as sparsity, runs of repeated values, or symmetry. Specializing for structure yields significant speedups. But automatica…

cs.PL2022★ 1 cited

Correct Compilation of Semiring Contractions

Scott Kovach, Fredrik Kjolstad

We introduce a formal operational semantics that describes the fused execution of variable contraction problems, which compute indexed arithmetic over a semiring and generalize spa…

cs.PL2022★ 29 cited

DISTAL: The Distributed Tensor Algebra Compiler

Rohan Yadav, Alex Aiken, Fredrik Kjolstad

We introduce DISTAL, a compiler for dense tensor algebra that targets modern distributed and heterogeneous systems. DISTAL lets users independently describe how tensors and computa…

cs.PL2022★ 53 cited

Compiler Support for Sparse Tensor Computations in MLIR

Aart J. C. Bik, Penporn Koanantakool, Tatiana Shpeisman +3

Sparse tensors arise in problems in science, engineering, machine learning, and data analytics. Programs that operate on such tensors can exploit sparsity to reduce storage require…

cs.PL2020★ 24 cited

Copy-and-Patch Compilation: A fast compilation algorithm for high-level languages and bytecode

Haoran Xu, Fredrik Kjolstad

Fast compilation is important when compilation occurs at runtime, such as query compilers in modern database systems and WebAssembly virtual machines in modern browsers. We present…