Timely Distributed Computation With Stragglers
Timely Distributed Computation With Stragglers
复制标题
DOI：
10.1109/tcomm.2020.3001873
复制
发表时间：
2019-10
影响因子：
8.3
通讯作者：
Baturalp Buyukates;S. Ulukus
中科院分区：
文献类型：
--
作者：
Baturalp Buyukates;S. Ulukus
我们考虑一个状态更新系统，其中更新数据包需要被处理，以提取嵌入的有用信息。源节点将获取的信息发送给由主节点和$n$个工作节点组成的计算单元（CU）。主节点将接收到的计算任务分发给工作节点。在计算时，主节点聚合结果并将其发送回源节点以保持其更新。我们调查的年龄性能的未编码和编码（重复编码，MDS编码，和多消息MDS（MM-MDS）编码）计划中存在的离散下i.i.d.指数传输延迟和I.I.D移位指数计算时间。我们证明了渐进MM-MDS编码方案优于其他方案。此外，我们的最佳代码的特点，使平均年龄最小化。
We consider a status update system in which the update packets need to be processed to extract the embedded useful information. The source node sends the acquired information to a computation unit (CU) which consists of a master node and $n$ worker nodes. The master node distributes the received computation task to the worker nodes. Upon computation, the master node aggregates the results and sends them back to the source node to keep it updated. We investigate the age performance of uncoded and coded (repetition coded, MDS coded, and multi-message MDS (MM-MDS) coded) schemes in the presence of stragglers under i.i.d. exponential transmission delays and i.i.d shifted exponential computation times. We show that asymptotically MM-MDS coded scheme outperforms the other schemes. Furthermore, we characterize the optimal codes such that the average age is minimized.