arXiv (All)
open access
DualColl: Throughput-Optimal Bandwidth-Bound Collective Communications via Fractional Tree Packing
and-cluster-computingdata-structures-and-algorithmsdistributednetworking-and-internet-architectureparallel
Large-scale distributed training increasingly makes collective communication bandwidth-bound. In modern GPU clusters, communication libraries such as NCCL implement collectives including AllReduce over heterogeneous interconnects such as NVLink, InfiniBand, and Ethernet, making efficient use of avai
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
- DualColl: Throughput-Optimal Bandwidth-Bound Collective Communications via Fractional Tree Packing#1318937
- mKernel: Fast Multi-GPU, Multi-Node Fused Kernels#1071362
- mKernel: Fast Multi-GPU, Multi-Node Fused Kernels#919318
- Federated SGD with local asynchrony#1251619
- dSTAR: Straggler Tolerant and Byzantine Resilient Distributed SGD#1035272
Record · ID 1326954
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