Automatic generation of efficient sparse tensor format conversion routines
© 2020 Owner/Author. This paper shows how to generate code that efficiently converts sparse tensors between disparate storage formats (data layouts) such as CSR, DIA, ELL, and many others. We decompose sparse tensor conversion into three logical phases: coordinate remapping, analysis, and assembly....
Main Authors: | Chou, Stephen, Kjolstad, Fredrik, Amarasinghe, Saman |
---|---|
Format: | Article |
Language: | English |
Published: |
ACM
2021
|
Online Access: | https://hdl.handle.net/1721.1/132254 |
Similar Items
-
Automatic generation of efficient sparse tensor format conversion routines
by: Chou, Stephen, et al.
Published: (2022) -
Format abstraction for sparse tensor algebra compilers
by: Chou, Stephen, et al.
Published: (2021) -
Sparse Tensor Transpositions
by: Mueller, Suzanne, et al.
Published: (2022) -
Autoscheduling for Sparse Tensor Algebra with an Asymptotic Cost Model
by: Ahrens, Willow, et al.
Published: (2022) -
A sparse iteration space transformation framework for sparse tensor algebra
by: Senanayake, Ryan, et al.
Published: (2021)