Looplets: A Language For Structured Coiteration
Not on the map. Why?
Abstract (arXiv)
Real world arrays often contain underlying structure, such as sparsity, runs of repeated values, or symmetry. Specializing for structure yields significant speedups. But automatically generating efficient code for structured data is challenging, especially when arrays with different structure interact. We show how to abstract over array structures so that the compiler can generate code to coiterate over any combination of them. Our technique enables new array formats (such as 1DVBL for irregular clustered sparsity), new iteration strategies (such as galloping intersections), and new operations over structured data (such as concatenation or convolution).
Key facts. Cited by 4 papers in the map (data through 14 Oct 2026). First posted on arXiv 8 Sep 2022.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2024: 1; 2025: 2; 2026: 1.
4 papers.
- 2024Compressing Structured Tensor Algebracited by 0
- 2025Ember: A Compiler for Efficient Embedding Operations on Decoupled Access-Execute Architecturescited by 0
- 2025FuseFlow: A Fusion-Centric Compilation Framework for Sparse Deep Learning on Streaming Dataflowcited by 0
- 2026JLIR: A Julia-Native MLIR-Inspired Intermediate Representation with Automatic JACC Kernel Extractioncited by 0
- 2026JLIR: A Julia-Native MLIR-Inspired Intermediate Representation with Automatic JACC Kernel Extraction4 Sep 2026
- 2025FuseFlow: A Fusion-Centric Compilation Framework for Sparse Deep Learning on Streaming Dataflow6 Nov 2025
- 2025Ember: A Compiler for Efficient Embedding Operations on Decoupled Access-Execute Architectures14 Apr 2025
- 2024Compressing Structured Tensor Algebra18 Jul 2024