arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2208.01437cs.DCcs.ITmath.IT
收藏

分层分辨率的分布式计算

Distributed Computations with Layered Resolution

Homa Esfahanizadeh, Alejandro Cohen, Muriel Médard, Shlomo Shamai

摘要:

现代计算繁重的应用程序通常对时间敏感,需要分布式策略来加速它们。另一方面,分布式计算在实际应用中也遇到了工作速度慢的瓶颈。分布式编码计算是一种有吸引力的解决方案,它增加了冗余,使得分布式计算的子集足以获得最终结果。然而,最终结果仍然要么在期望的时间内获得要么没有获得,并且对于后者,所花费的资源被浪费。在本文中,我们引入了分层分辨率分布式编码计算的新概念,使得从工人的集体结果中获得最终结果的分辨率较低-在比最终结果更早的阶段。这一创新使得更有效的基于截止日期的系统成为可能,因为即使计算作业因时间而终止,也可以发布最终结果的近似版本。根据我们的理论和实证结果,平均执行延迟的第一个决议是显着小于一个最终决议。此外,满足最后期限的概率是第一个解决方案的最后解决方案几乎总是超过最后期限,降低了没有分层的系统的成功率。

英文摘要:

Modern computationally-heavy applications are often time-sensitive, demanding distributed strategies to accelerate them. On the other hand, distributed computing suffers from the bottleneck of slow workers in practice. Distributed coded computing is an attractive solution that adds redundancy such that a subset of distributed computations suffices to obtain the final result. However, the final result is still either obtained within a desired time or not, and for the latter, the resources that are spent are wasted. In this paper, we introduce the novel concept of layered-resolution distributed coded computations such that lower resolutions of the final result are obtained from collective results of the workers -- at an earlier stage than the final result. This innovation makes it possible to have more effective deadline-based systems, since even if a computational job is terminated because of timing, an approximated version of the final result can be released. Based on our theoretical and empirical results, the average execution delay for the first resolution is notably smaller than the one for the final resolution. Moreover, the probability of meeting a deadline is one for the first resolution in a setting where the final resolution exceeds the deadline almost all the time, reducing the success rate of the systems with no layering.

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

↑