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

多任务并行作业的延迟渐近性和界

Delay Asymptotics and Bounds for Multi-Task Parallel Jobs

Weina Wang, Mor Harchol-Balter, Haotian Jiang, Alan Scheller-Wolf, R. Srikant

摘要:

本文研究了由多个并行任务组成的作业的延迟问题,该问题在编码存储系统中的数据文件检索和并行计算等广泛应用中是一个重要的性能指标。在该问题中,每个作业只有在其所有任务都完成时才完成,因此作业的延迟是其任务延迟的最大值。尽管这个问题已经得到了广泛的关注,严密的分析仍然是未知的,因为分析作业延迟需要表征任务延迟之间的复杂相关性,这是很难做到的。我们首先考虑一个渐近制度的服务器,$n$,去无穷大,和任务的数量在一个作业,$k^{(n)}$,允许增加与$n$。在条件$k^{(n)} = o(n^{1/4})$下建立了任意$k^{(n)}$排队的渐近独立性.这极大地推广了文献中的渐近独立类型的结果,其中渐近独立只显示为一个固定的常数数量的队列。由于我们的独立性的结果,工作延迟收敛到最大的独立任务延迟。接下来我们考虑非渐近状态。在这里,我们证明了独立产生一个随机上限的工作延迟任何$n$和任何$k^{(n)}$与$k^{(n)}\le n$。我们证明的关键组成部分是我们开发的一种新技术,称为“泊松过采样”。我们的方法将作业延迟问题转化为相应的球和箱子问题。然而,在与典型的球和箱子的问题,有一个负相关的箱子之间,我们证明了我们的变体呈现出正相关性。

英文摘要:

We study delay of jobs that consist of multiple parallel tasks, which is a critical performance metric in a wide range of applications such as data file retrieval in coded storage systems and parallel computing. In this problem, each job is completed only when all of its tasks are completed, so the delay of a job is the maximum of the delays of its tasks. Despite the wide attention this problem has received, tight analysis is still largely unknown since analyzing job delay requires characterizing the complicated correlation among task delays, which is hard to do. We first consider an asymptotic regime where the number of servers, $n$, goes to infinity, and the number of tasks in a job, $k^{(n)}$, is allowed to increase with $n$. We establish the asymptotic independence of any $k^{(n)}$ queues under the condition $k^{(n)} = o(n^{1/4})$. This greatly generalizes the asymptotic-independence type of results in the literature where asymptotic independence is shown only for a fixed constant number of queues. As a consequence of our independence result, the job delay converges to the maximum of independent task delays. We next consider the non-asymptotic regime. Here we prove that independence yields a stochastic upper bound on job delay for any $n$ and any $k^{(n)}$ with $k^{(n)}\le n$. The key component of our proof is a new technique we develop, called "Poisson oversampling". Our approach converts the job delay problem into a corresponding balls-and-bins problem. However, in contrast with typical balls-and-bins problems where there is a negative correlation among bins, we prove that our variant exhibits positive correlation.

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

↑