arXiv (All)
open access
Partitioning Unstructured Sparse Tensor Algebra for Load-Balanced Parallel Execution
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 partitioning algorithm that provably load balances the computation of any sparse tensor algebra expression across paralle
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- WingSpan: Concurrency and Dependence for Sparse and Structured Tensor Compilers#677649
- WingSpan: Concurrency and Dependence for Sparse and Structured Tensor Compilers#674448
- SparseConflicts: Handling Conflicting Data Layouts in Sparse Tensor Contractions#973909
- Unleashing the Power of Equality Saturation for Tensor Program Superoptimization#1000287
- T-CCL: Resource Efficient and Performant Collective Communication using Tensor Memory Accelerator#1216473
Record · ID 1388356
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive