arXiv (All)
open access
SP-Allreduce: Symmetric Tree Schedules for Tori and Beyond
Allreduce is a fundamental communication primitive in large-scale distributed training, and torus interconnects remain widely deployed in high-performance systems. We introduce SP-allreduce, a new allreduce algorithm for $d$-dimensional tori that exploits the symmetry of the topology and routes only
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
- SP-Allreduce: Symmetric Tree Schedules for Tori and Beyond#1318989
- Network-in-the-Loop at Scale: GPU-Batched 5G Simulation for Massively Parallel Robot Learning#1186684
- Network-in-the-Loop at Scale: GPU-Batched 5G Simulation for Massively Parallel Robot Learning#1181596
- The Memory Tesseract: Distributed MINERVA and the Unification of Memory#1038638
- ELDR: Expert-Locality-Aware Decode Routing for PD-Disaggregated MoE Serving#329057
Record · ID 1327977
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