Rate-limited Shuffling for Distributed Computing
CoRR(2024)
摘要
This paper studies the shuffling phase in a distributed computing model with
rate-limited links between nodes. Each node is connected to all other nodes via
a noiseless broadcast link with a finite capacity. For this network, the
shuffling phase is described as a distributed index-coding problem to extend an
outer bound for the latter to the distributed computing problem. An inner bound
on the capacity region is also established by using the distributed
composite-coding scheme introduced for the distributed index-coding problem. We
consider some special cases of the distributed computing problem through two
examples for which we prove that the inner and outer bounds agree, thereby
establishing the capacity regions. We, then, generalize the special cases to
any number of nodes and computation loads under certain constraints.
更多查看译文
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要