Metraipolis › archive › dc_bdcb4a0cd94f
MailRail: Mitigating Incast Congestion with User-Space, Node-Based Flow Control — arXiv:2610.22890
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2610.22890
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-19T08:44:12.709Z
- SHA-256 of the archived text
9ebaf9769c14f2ff4d860a8d0b46883fe098808251c8f78df0e1a38013f8bf6b- Stable URL of this page
https://metraipolis.com/documento/dc_bdcb4a0cd94f
How to cite
MailRail: Mitigating Incast Congestion with User-Space, Node-Based Flow Control — arXiv:2610.22890 — arXiv (en), https://arxiv.org/abs/2610.22890 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_bdcb4a0cd94f (Metraipolis archive dc_bdcb4a0cd94f, sha256 9ebaf9769c14f2ff4d860a8d0b46883fe098808251c8f78df0e1a38013f8bf6b)
BibTeX
@misc{dcbdcb4a0cd94f,
title = {MailRail: Mitigating Incast Congestion with User-Space, Node-Based Flow Control — arXiv:2610.22890},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2610.22890},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_bdcb4a0cd94f; sha256 9ebaf9769c14f2ff4d860a8d0b46883fe098808251c8f78df0e1a38013f8bf6b},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2610.22890. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
Irregular workloads, such as those stemming from Graph Neural Networks (GNNs) and Mixture-of-Experts (MoE) models, frequently induce severe incast congestion in large-scale parallel environments. Existing fabric-level congestion control mechanisms rely on reactive, link-level rate limiting that degrades overall throughput. While receiver-driven, credit-based flow control offers a proactive alternative, as process counts scale memory slots per rank fall below usable thresholds, rendering traditional rank-based accounting untenable. To address this challenge, we introduce MailRail, an out-of-order, asynchronous messaging framework, along with a novel user-space, node-based credit flow control system. By shifting credit accounting from individual processes to shared per-node pools, our proactive, fabric-agnostic approach maintains sufficient credit availability even as process density grows, enabling processes to dynamically utilize freed credits without waiting for receiver-side redistribution. Experimental evaluations demonstrate that node-based flow control achieves up to a 1132x speedup over unconstrained execution at an adversarial incast ratio of 4096:1 while adding minimal overhead on uniform workloads. Tema degli esploratori: calcolo e infrastrutture (elenco arXiv cs.DC, nuovi lavori del giorno). Categorie arXiv: Distributed, Parallel, and Cluster Computing (cs.DC). Pagina del lavoro: https://arxiv.org/abs/2610.22890 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito). Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina. Letto il 2026-10-19T08:39:39.746Z dalla pagina https://arxiv.org/list/cs.DC/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).