arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2401.16181cs.ITmath.IT
收藏

关于计算成本最小的去中心化线性可分计算

On Decentralized Linearly Separable Computation With the Minimum Computation Cost

Haoning Chen, Minquan Cheng, Zhenhao Huang, Youlong Wu

AI总结:

本文研究完全去中心化场景下计算成本最小的线性可分计算问题,提出循环数据分配下最优的分布式计算方案,揭示了边信息对通信成本的影响与K_c取值的关联。

摘要:

分布式线性可分计算问题在分布式梯度编码、分布式线性变换、实时渲染等领域有着广泛应用。本文在完全去中心化场景下研究该问题,即N个工作节点无需中心主节点,协作执行计算任务。每个工作节点需要计算可表示为K条消息的K_c个线性组合的线性可分计算,其中每条消息对应一个不同数据集的函数。我们要求每个工作节点可基于任意N_r个工作节点的传输内容成功完成任务,从而系统可容忍任意N−N_r个掉队节点。我们聚焦于计算成本(分配给每个工作节点的未编码数据集数量)最小的场景,目标是最小化通信成本(最快的N_r个工作节点传输的符号数)。我们提出了一种新颖的分布式计算方案,在广泛使用的循环数据分配下是最优的。有趣的是,我们证明当K_c ≤ K N_r / N时,每个工作节点的边信息对降低通信成本无效,而随着K_c增大,边信息有助于降低通信成本。

英文摘要:

The distributed linearly separable computation problem finds extensive applications across domains such as distributed gradient coding, distributed linear transform, real-time rendering, etc. In this paper, we investigate this problem in a fully decentralized scenario, where $\mathsf{N}$ workers collaboratively perform the computation task without a central master. Each worker aims to compute a linearly separable computation that can be manifested as $\mathsf{K}_{\mathrm{c}}$ linear combinations of $\mathsf{K}$ messages, where each message is a function of a distinct dataset. We require that each worker successfully fulfill the task based on the transmissions from any $\mathsf{N}_{\mathrm{r}}$ workers, such that the system can tolerate any $\mathsf{N}-\mathsf{N}_{\mathrm{r}}$ stragglers. We focus on the scenario where the computation cost (the number of uncoded datasets assigned to each worker) is minimum, and aim to minimize the communication cost (the number of symbols the fastest $\mathsf{N}_{\mathrm{r}}$ workers transmit). We propose a novel distributed computing scheme that is optimal under the widely used cyclic data assignment. Interestingly, we demonstrate that the side information at each worker is ineffective in reducing the communication cost when $\mathsf{K}_{\mathrm{c}}\leq {\mathsf{K}}\mathsf{N}_{\mathrm{r}}/{\mathsf{N}}$, while it helps reduce the communication cost as $\mathsf{K}_{\mathrm{c}}$ increases.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑