1 citations · 1 across the 4 of their papers we have counts for
Showing 2026Show all
2 papers · 1 filter
cs.PL2026
SparseConflicts: Handling Conflicting Data Layouts in Sparse Tensor Contractions
Adhitha Dias, Kirshanthan Sundararajah, Artem Pelenitsyn +1
Optimizing sparse tensor computations is challenging due to the use of compressed storage formats, which leads to non-affine loop nests and a vast, complex schedule space. The perf…
cs.PL2026
SoCal: A Language for Memory-Layout Factorization of Recursive Datatypes
Vidush Singhal, Mikah Kainen, Artem Pelenitsyn +3
Array-of-structures (AoS) to structure-of-arrays (SoA) is a classic compiler transformation that improves memory locality and enables data-parallel execution. Existing AoS-to-SoA t…