arXiv (All)
open access
Unleashing the Power of Equality Saturation for Tensor Program Superoptimization
Efficient GPU implementations of tensor programs often require joint optimization of high-level algebraic formulations and low-level execution strategies. However, the resulting search space grows rapidly as transformations combine across operators, making joint optimization difficult to scale. We p
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
- Low-Latency Coded Tensor--Matrix Multiplication for Distributed Signal Processing Systems#1104766
- Prism: Symbolic Superoptimization of Tensor Programs#18998
- Exo-GPU: Safe, Imperative, User-schedulable Programming for Tensor Cores#1110750
- WingSpan: Concurrency and Dependence for Sparse and Structured Tensor Compilers#677649
- WingSpan: Concurrency and Dependence for Sparse and Structured Tensor Compilers#674448
Record · ID 1000287
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