论文标题
拓扑编码分布计算
Topological Coded Distributed Computing
论文作者
论文摘要
本文考虑了Li等人最初提出的类似MapReduce的编码分布式计算框架，该框架在分布式计算服务器交换其计算的中间值时使用编码技术，以减少整体流量负载。他们的原始模型服务器通过无错误的通信总线连接，允许广播传输。但是，此假设是实践中的主要局限性之一，因为实用的云计算网络拓扑比简单的单个总线更重要。我们制定了一个拓扑编码的分布式计算问题，其中分布式服务器通过某些交换机网络相互通信。通过使用Al-Fares等人提出的脂肪树拓扑的特殊实例，称为T-ary脂肪树。可以通过一些便宜的开关来构建，我们提出了一个编码的分布式计算方案，以实现所有链接上最大负载定义的最大最大链接通信负载。
This paper considers the MapReduce-like coded distributed computing framework originally proposed by Li et al., which uses coding techniques when distributed computing servers exchange their computed intermediate values, in order to reduce the overall traffic load. Their original model servers are connected via an error-free common communication bus allowing broadcast transmissions. However, this assumption is one of the major limitations in practice since the practical cloud computing network topologies are far more involved than a simple single bus. We formulate a topological coded distributed computing problem, where the distributed servers communicate with each other through some switch network. By using a special instance of fat-tree topologies, referred to as t-ary fat-tree proposed by Al-Fares et al. which can be built by some cheap switches, we propose a coded distributed computing scheme to achieve the minimum max-link communication load defined as the maximum load over all links.
