Compilation of Shape Operators on Sparse Arrays

We show how to build a compiler for a sparse array language that supports shape operators such as reshaping or concatenating arrays, in addition to compute operators. Existing sparse array programming systems implement generic shape operators for only some sparse data structures, reduce shape operat...

Celý popis

Podrobná bibliografia

Vydané v:	Proceedings of ACM on programming languages Ročník 8; číslo OOPSLA2; s. 1162 - 1188
Hlavní autori:	Root, Alexander J, Yan, Bobby, Liu, Peiming, Gyurgyik, Christophe, Bik, Aart J.C., Kjolstad, Fredrik
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	New York, NY, USA ACM 08.10.2024
Predmet:	Domain specific languages Software and its engineering Source code generation sparse array programming sparse iteration theory sparse data structures
ISSN:	2475-1421, 2475-1421
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!