arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1404.1328cs.DC
收藏

并行计算中快速响应时间的有效任务复制

Efficient Task Replication for Fast Response Times in Parallel Computation

Da Wang, Gauri Joshi, Gregory Wornell

摘要:

数据中心大规模分布式计算的一个典型用例是将计算作业分解为许多独立的任务,并在不同的机器上并行运行它们,有时被称为“令人尴尬的并行”计算。对于这种类型的计算,一个挑战是每个机器执行任务的时间是固有的可变的,并且总的响应时间受到最慢机器的执行时间的约束。为了解决这个问题,系统设计者引入了任务复制,它将相同的任务发送到多台机器,并从第一台完成的机器获得结果。虽然任务复制减少了响应时间,但它通常会增加资源使用。在这项工作中,我们提出了一个理论框架来分析之间的权衡响应时间和资源使用。我们表明,虽然在一般情况下,有一个响应时间和资源使用之间的紧张局势,存在的情况下,复制任务明智地减少完成时间和资源使用量同时。给定机器的执行时间分布,我们调查的调度策略,以实现最佳的性能权衡的条件,并提出有效的算法来搜索最佳或接近最佳的调度策略。我们的分析提供了见解,何时以及为什么复制的帮助,这可以用来指导调度器设计在大规模分布式计算系统。

英文摘要:

One typical use case of large-scale distributed computing in data centers is to decompose a computation job into many independent tasks and run them in parallel on different machines, sometimes known as the "embarrassingly parallel" computation. For this type of computation, one challenge is that the time to execute a task for each machine is inherently variable, and the overall response time is constrained by the execution time of the slowest machine. To address this issue, system designers introduce task replication, which sends the same task to multiple machines, and obtains result from the machine that finishes first. While task replication reduces response time, it usually increases resource usage. In this work, we propose a theoretical framework to analyze the trade-off between response time and resource usage. We show that, while in general, there is a tension between response time and resource usage, there exist scenarios where replicating tasks judiciously reduces completion time and resource usage simultaneously. Given the execution time distribution for machines, we investigate the conditions for a scheduling policy to achieve optimal performance trade-off, and propose efficient algorithms to search for optimal or near-optimal scheduling policies. Our analysis gives insights on when and why replication helps, which can be used to guide scheduler design in large-scale distributed computing systems.

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

↑