Portrait of Fredrik Kjolstad

Fredrik Kjolstad

Assistant Professor of Computer Science

Fredrik Kjolstad is an Assistant Professor in the Department of Computer Science at Stanford University. His group develops programming languages and compiler systems that make high-level applications portable across different data representations and different machines. This work spans compilers for sparse tensor algebra and other operations on sparse data, languages over collections such as tensors, relations, graphs, and objects embedded in space, and meta-compilers that generate compilers for different languages and targets.

He is the original author of the Tensor Algebra Compiler (TACO) and, with collaborators, has built systems including Simit, DISTAL, the Sparse Abstract Machine, and Copy-and-Patch compilation. His PhD thesis, Sparse Tensor Algebra Compilation, introduces the tensor algebra compiler and its sparse iteration model.

Software

Publications

All 52

Optimal Software Pipelining and Warp Specialization for Tensor Core GPUs

Rupanshu Soi Rohan Yadav Fredrik Kjolstad Alex Aiken Maryam Mehri DehnaviMichael GarlandMichael Bauer

OSDI Jul 2026

PDF
BibTeX
@inproceedings{soi2026optimal,
  author    = {Soi, Rupanshu and Yadav, Rohan and Kjolstad, Fredrik and Aiken, Alex and Dehnavi, Maryam Mehri and Garland, Michael and Bauer, Michael},
  title     = {Optimal Software Pipelining and Warp Specialization for Tensor Core {GPUs}},
  booktitle = {20th USENIX Symposium on Operating Systems Design and Implementation (OSDI 26)},
  year      = {2026},
  month     = jul,
  pages     = {1875--1890},
  publisher = {USENIX Association},
  address   = {Seattle, WA},
  isbn      = {978-1-939133-55-7},
  url       = {https://www.usenix.org/conference/osdi26/presentation/soi}
}
Cite

Rupanshu Soi, Rohan Yadav, Fredrik Kjolstad, Alex Aiken, Maryam Mehri Dehnavi, Michael Garland, and Michael Bauer. Optimal Software Pipelining and Warp Specialization for Tensor Core GPUs. OSDI, 2026.

A Compiler for Fused Relational Operations on Multisets

James Dong Fredrik Kjolstad

PLDI · PACMPL vol. 10, PLDI Jun 2026

PDF DOI
BibTeX
@article{dong2026compiler,
  author    = {Dong, James and Kjolstad, Fredrik},
  title     = {A Compiler for Fused Relational Operations on Multisets},
  journal   = {Proceedings of the ACM on Programming Languages},
  year      = {2026},
  month     = jun,
  volume    = {10},
  number    = {PLDI},
  articleno = {205},
  numpages  = {25},
  publisher = {Association for Computing Machinery},
  address   = {New York, NY, USA},
  doi       = {10.1145/3808283},
  url       = {https://doi.org/10.1145/3808283},
  keywords  = {relational algebra, databases, sparse compilation, multisets, bags}
}
Cite

James Dong and Fredrik Kjolstad. A Compiler for Fused Relational Operations on Multisets. PLDI, 2026.

Bonsai: Compiling Queries to Pruned Tree Traversals

Alexander J Root Christophe Gyurgyik Purvi GoelKayvon Fatahalian Jonathan Ragan-Kelley Andrew Adams Fredrik Kjolstad

PLDI · PACMPL vol. 10, PLDI Jun 2026 Distinguished Paper Award

PDF DOI
BibTeX
@article{root2026bonsai,
  author    = {Root, Alexander J and Gyurgyik, Christophe and Goel, Purvi and Fatahalian, Kayvon and Ragan-Kelley, Jonathan and Adams, Andrew and Kjolstad, Fredrik},
  title     = {{Bonsai}: Compiling Queries to Pruned Tree Traversals},
  journal   = {Proceedings of the ACM on Programming Languages},
  year      = {2026},
  month     = jun,
  volume    = {10},
  number    = {PLDI},
  articleno = {178},
  numpages  = {29},
  publisher = {Association for Computing Machinery},
  address   = {New York, NY, USA},
  doi       = {10.1145/3808256},
  url       = {https://doi.org/10.1145/3808256},
  keywords  = {compilation, data independence, acceleration structures, tree data structures}
}
Cite

Alexander J Root, Christophe Gyurgyik, Purvi Goel, Kayvon Fatahalian, Jonathan Ragan-Kelley, Andrew Adams, and Fredrik Kjolstad. Bonsai: Compiling Queries to Pruned Tree Traversals. PLDI, 2026.

Decoupling Data Layouts from Bounding Volume Hierarchies

Christophe Gyurgyik Alexander J Root Fredrik Kjolstad

PLDI · PACMPL vol. 10, PLDI Jun 2026

PDF DOI
BibTeX
@article{gyurgyik2026decoupling,
  author    = {Gyurgyik, Christophe and Root, Alexander J and Kjolstad, Fredrik},
  title     = {Decoupling Data Layouts from Bounding Volume Hierarchies},
  journal   = {Proceedings of the ACM on Programming Languages},
  year      = {2026},
  month     = jun,
  volume    = {10},
  number    = {PLDI},
  articleno = {175},
  numpages  = {39},
  publisher = {Association for Computing Machinery},
  address   = {New York, NY, USA},
  doi       = {10.1145/3808253},
  url       = {https://doi.org/10.1145/3808253},
  keywords  = {acceleration structure, data independence, augmented tree, specialization}
}
Cite

Christophe Gyurgyik, Alexander J Root, and Fredrik Kjolstad. Decoupling Data Layouts from Bounding Volume Hierarchies. PLDI, 2026.

Onyx: A 12-nm Programmable Accelerator for Dense and Sparse Applications

Kalhan Koul Olivia Hsu Yuchen Mei Sai Gautham Ravipati Maxwell StrangeJackson MelchertAlex CarselloTaeyoung KongPo-Han ChenHuifeng KeKeyi ZhangQiaoyi LiuGedeon NyengeleZhouhua XieAkhilesh BalasingamJayashree AdivarahanRitvik SharmaChristopher TorngJoel S. Emer Fredrik Kjolstad Mark HorowitzPriyanka Raina

IEEE JSSC · vol. 61, no. 5 May 2026

DOI
BibTeX
@article{koul2026onyx,
  author    = {Koul, Kalhan and Hsu, Olivia and Mei, Yuchen and Ravipati, Sai Gautham and Strange, Maxwell and Melchert, Jackson and Carsello, Alex and Kong, Taeyoung and Chen, Po-Han and Ke, Huifeng and Zhang, Keyi and Liu, Qiaoyi and Nyengele, Gedeon and Xie, Zhouhua and Balasingam, Akhilesh and Adivarahan, Jayashree and Sharma, Ritvik and Torng, Christopher and Emer, Joel S. and Kjolstad, Fredrik and Horowitz, Mark and Raina, Priyanka},
  title     = {{Onyx}: A 12-nm Programmable Accelerator for Dense and Sparse Applications},
  journal   = {IEEE Journal of Solid-State Circuits},
  year      = {2026},
  month     = may,
  volume    = {61},
  number    = {5},
  pages     = {2336--2348},
  publisher = {IEEE},
  doi       = {10.1109/JSSC.2025.3604724},
  url       = {https://doi.org/10.1109/JSSC.2025.3604724},
  keywords  = {Coarse-grained reconfigurable array (CGRA), compilers, computer vision, image processing, machine learning (ML), reconfigurable accelerators, sparse matrices}
}
Cite

Kalhan Koul, Olivia Hsu, Yuchen Mei, Sai Gautham Ravipati, Maxwell Strange, Jackson Melchert, Alex Carsello, Taeyoung Kong, Po-Han Chen, Huifeng Ke, Keyi Zhang, Qiaoyi Liu, Gedeon Nyengele, Zhouhua Xie, Akhilesh Balasingam, Jayashree Adivarahan, Ritvik Sharma, Christopher Torng, Joel S. Emer, Fredrik Kjolstad, Mark Horowitz, and Priyanka Raina. Onyx: A 12-nm Programmable Accelerator for Dense and Sparse Applications. IEEE JSSC, 2026.

Deegen: A JIT-Capable VM Generator for Dynamic Languages

Haoran Xu Fredrik Kjolstad

OOPSLA · PACMPL vol. 10, OOPSLA1 Apr 2026

PDF DOI
BibTeX
@article{xu2026deegen,
  author    = {Xu, Haoran and Kjolstad, Fredrik},
  title     = {{Deegen}: A {JIT}-Capable {VM} Generator for Dynamic Languages},
  journal   = {Proceedings of the ACM on Programming Languages},
  year      = {2026},
  month     = apr,
  volume    = {10},
  number    = {OOPSLA1},
  articleno = {138},
  numpages  = {29},
  publisher = {Association for Computing Machinery},
  address   = {New York, NY, USA},
  doi       = {10.1145/3798246},
  url       = {https://doi.org/10.1145/3798246},
  keywords  = {Inline Caching, Dynamic Languages, Binary Code Patching}
}
Cite

Haoran Xu and Fredrik Kjolstad. Deegen: A JIT-Capable VM Generator for Dynamic Languages. OOPSLA, 2026.

All people