arXiv (All)
open access
Exposing Embedded Matrix Multiplication with polyhedral transformations for CGRA compilation
Matrix-matrix multiplication (mmul) is a dominant computing pattern in edge workloads, but in real applications it is often embedded within larger affine programs and intertwined with other operations. Coarse-Grained Reconfigurable Arrays (CGRAs) can flexibly and efficiently support it, since they c
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
- Efficient Compression in Semigroups#1084110
- Compiler Generation and Autotuning of Communication-Avoiding Operators for Geometric Multigrid#624361
- Helix: A Unified Programmable Accelerator for Diverse Krylov Subspace Solvers#1356432
- Helix: A Unified Programmable Accelerator for Diverse Krylov Subspace Solvers#1348826
- Toward the Integration of Numerical Computations into the OMSCS Framework#1219604
Record · ID 1400900
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