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

多轮优先下的MapReduce作业调度

Scheduling MapReduce Jobs under Multi-Round Precedences

Dimitris Fotakis, Ioannis Milis, Orestis Papadigenopoulos, Vasilis Vassalos, Georgios Zois

摘要:

我们考虑非抢占式调度的MapReduce作业多个任务的实际情况下,每个作业需要几个map-reduce轮。我们寻求最小化的平均加权完成时间,并考虑调度相同和不相关的并行处理器。对于相同的处理器,我们提出了基于LP的O(1)-近似算法。对于不相关的处理器,近似比自然地取决于任何作业的最大轮数。由于典型的MapReduce算法中每个作业的轮数是一个很小的常数,我们的调度算法在实践中实现了一个小的近似比。对于单轮的情况下,我们大大提高了以前最好的已知近似保证相同和不相关的处理器。此外,我们进行了实验分析,并比较我们的算法对快速启发式和最优解的下限的性能,从而证明了他们有前途的实际性能。

英文摘要:

We consider non-preemptive scheduling of MapReduce jobs with multiple tasks in the practical scenario where each job requires several map-reduce rounds. We seek to minimize the average weighted completion time and consider scheduling on identical and unrelated parallel processors. For identical processors, we present LP-based O(1)-approximation algorithms. For unrelated processors, the approximation ratio naturally depends on the maximum number of rounds of any job. Since the number of rounds per job in typical MapReduce algorithms is a small constant, our scheduling algorithms achieve a small approximation ratio in practice. For the single-round case, we substantially improve on previously best known approximation guarantees for both identical and unrelated processors. Moreover, we conduct an experimental analysis and compare the performance of our algorithms against a fast heuristic and a lower bound on the optimal solution, thus demonstrating their promising practical performance.

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

↑