跳到正文
研踪PaperTrail
← 研踪 PaperTrail

arXiv:2611.21190 · v1

Linear Network Coding for Sum All-Reduce over Ring Networks

首次提交 2026-11-16 22:46
版本更新 2026-11-16 22:46
雷达观测 2026-11-17 17:11
arXiv ↗PDF ↗

摘要

Sum All-Reduce is a fundamental collective communication primitive in which each node holds a local vector and every node must recover the componentwise sum of all vectors. In distributed training, this operation is often implemented over a ring topology using a reduce--multicast scheme. We study sum All-Reduce on directed rings via linear network coding, which includes reduce--multicast as a special case. We give a necessary and sufficient feasibility condition in terms of the coding matrices. For a ring with N≥3N\geq 3 nodes and unit-capacity links, where each node holds a vector containing KK symbols, we prove that the number of time units TT required by any feasible linear code satisfies T≥max⁡{K+N−2, ⌈2(N−1)NK⌉}T\ge\max\bigl\{K+N-2,\ \lceil\frac{2(N-1)}{N}K\rceil\bigr\}, giving a rate K/TK/T of at most N/(2(N−1))N/(2(N-1)). The bound is tight over every field. When K≥NK\ge N, an interleaved reduce--multicast code achieves the bound; when K<NK<N and KK divides NN, a reduce--partial-multicast code does. When K<NK<N and KK does not divide NN, no coordinate-wise code---in particular, no reduce--multicast code---achieves the bound, while an explicit linear network code does.

AI 论文解读

基于摘要 · 非全文审阅

此版本尚未生成 AI 解读。解读由后台任务生成并按论文版本保存,登录后共享已有结果。

版本差异

目前只收录了一个版本。收录下一版后,可以对照标题、作者、分类和摘要。

观测到的版本

相邻记录可能跳过中间版本;首次发现 v2 及以上也会标为版本更新。

v1 · 2026-11-16 22:46 · 最新观测版本

Linear Network Coding for Sum All-Reduce over Ring Networks

Sum All-Reduce is a fundamental collective communication primitive in which each node holds a local vector and every node must recover the componentwise sum of all vectors. In distributed training, this operation is often implemented over a ring topology using a reduce--multicast scheme. We study sum All-Reduce on directed rings via linear network coding, which includes reduce--multicast as a special case. We give a necessary and sufficient feasibility condition in terms of the coding matrices. For a ring with N≥3N\geq 3 nodes and unit-capacity links, where each node holds a vector containing KK symbols, we prove that the number of time units TT required by any feasible linear code satisfies T≥max⁡{K+N−2, ⌈2(N−1)NK⌉}T\ge\max\bigl\{K+N-2,\ \lceil\frac{2(N-1)}{N}K\rceil\bigr\}, giving a rate K/TK/T of at most N/(2(N−1))N/(2(N-1)). The bound is tight over every field. When K≥NK\ge N, an interleaved reduce--multicast code achieves the bound; when K<NK<N and KK divides NN, a reduce--partial-multicast code does. When K<NK<N and KK does not divide NN, no coordinate-wise code---in particular, no reduce--multicast code---achieves the bound, while an explicit linear network code does.

查看此版本解读 →查看此版本原文 ↗