8 citations · 11 across the 8 of their papers we have counts for
4 papers · 1 filter
Insum: Sparse GPU Kernels Simplified and Optimized with Indirect Einsums
Jaeyeon Won, Willow Ahrens, Joel S. Emer +1
Programming high-performance sparse GPU kernels is notoriously difficult, requiring both substantial effort and deep expertise. Sparse compilers aim to simplify this process, but e…
The Continuous Tensor Abstraction: Where Indices are Real
Jaeyeon Won, Willow Ahrens, Teodoro Fields Collin +2
This paper introduces the continuous tensor abstraction, allowing indices to take real-number values (for example, A[3.14]). It also presents continuous tensor algebra expressions,…
Mechanised Hypersafety Proofs about Structured Data: Extended Version
Vladimir Gladshtein, Qiyuan Zhao, Willow Ahrens +2
Arrays are a fundamental abstraction to represent collections of data. It is often possible to exploit structural properties of the data stored in an array (e.g., repetition or spa…
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…