3 papers
cs.PL2026
Bonsai: Compiling Queries to Pruned Tree Traversals
Alexander J Root, Christophe Gyurgyik, Purvi Goel +4
Trees can accelerate queries that search or aggregate values over large collections. They achieve this by storing metadata that enables quick pruning (or inclusion) of subtrees whe…
cs.PL2026
Partitioning Unstructured Sparse Tensor Algebra for Load-Balanced Parallel Execution
Atharva Chougule, Alexander J Root, Rubens Lacouture +3
Sparse tensor algebra is challenging to efficiently parallelize due to the irregular, data-dependent, and potentially skewed structure of sparse computation. We propose the first p…
cs.PL2026
Decoupling Data Layouts from Bounding Volume Hierarchies
Christophe Gyurgyik, Alexander J Root, Fredrik Kjolstad
Bounding volume hierarchies are ubiquitous acceleration structures in graphics, scientific computing, and data analytics. Their performance depends critically on data layout choice…