arXiv (All)
open access
Tiga: Compiling Graph Message Passing at Scale
Graph message passing offers a common way to express learning algorithms, physical simulations, and numerical solvers. Efficient execution depends on interaction structure and data movement, which can be obscured when a program is expressed as a sequence of tensor operations. On memory-constrained s
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
- Tiga: Compiling Graph Message Passing at Scale#1028649
- Graph Homomorphisms and Universal Algebra#1109003
- Graph Machine: Towards Better Pretraining via Edges#632823
- Implementing High-Performance Geometric Multigrid Solver with Naturally Grained Messages#784329
- fastp: an ultra-fast all-in-one FASTQ preprocessor#6323
Record · ID 1051203
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