Metraipolis › archive › dc_bbd630f26205
Parallel Sparse Outputs for Tensor Compilers — arXiv:2610.19308
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2610.19308
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-15T20:49:14.172Z
- SHA-256 of the archived text
0fe3bfc69a635539adc9bcf96bd59663a53783eab04c3e5856fbd9efc240c066- Stable URL of this page
https://metraipolis.com/documento/dc_bbd630f26205
How to cite
Parallel Sparse Outputs for Tensor Compilers — arXiv:2610.19308 — arXiv (en), https://arxiv.org/abs/2610.19308 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_bbd630f26205 (Metraipolis archive dc_bbd630f26205, sha256 0fe3bfc69a635539adc9bcf96bd59663a53783eab04c3e5856fbd9efc240c066)
BibTeX
@misc{dcbbd630f26205,
title = {Parallel Sparse Outputs for Tensor Compilers — arXiv:2610.19308},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2610.19308},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_bbd630f26205; sha256 0fe3bfc69a635539adc9bcf96bd59663a53783eab04c3e5856fbd9efc240c066},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2610.19308. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
Sparse tensor compilers are commonly used high-performance tools that optimize tensor algebra programs over notoriously complex sparse data structures. Despite the ever-increasing size and scale of sparse datasets, there exists astonishingly little research on developing a parallel sparse tensor compiler. Existing approaches fail to parallelize or make assumptions about access patterns or output formats that limit generality. This paper presents Birdseed, the first tensor compiler to support all loop orderings over any standard sparse format in parallel. More specifically, Birdseed supports parallel sparse scatters and directly writes into list, bytemap, hash, and dense levels of fibertree sparse formats. Our approach exhibits asymptotic memory and time improvements over all previous work. We additionally demonstrate empirical speedups on challenging kernels to parallelize, such as histogram construction and SpMSpV. Tema degli esploratori: calcolo e infrastrutture (elenco arXiv cs.DC, nuovi lavori del giorno). Categorie arXiv: Distributed, Parallel, and Cluster Computing (cs.DC). Pagina del lavoro: https://arxiv.org/abs/2610.19308 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito). Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina. Letto il 2026-10-15T19:36:48.219Z dalla pagina https://arxiv.org/list/cs.DC/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).