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

带延迟的工作窃取

Work Stealing with latency

Mohammed Khatiri, Denis Trystram, Frederic Wagner

摘要:

本文研究了通信延迟对经典的工作窃取负载均衡算法的影响。我们的方法考虑了现有的性能模型和底层算法。我们在模型中引入了一个延迟参数,并通过仔细观察模拟结果来研究其整体影响。使用这种方法,我们能够得到一个新的表达式的预期运行时间的可分负载应用程序。这个表达式使我们能够预测在哪些条件下给定的运行将产生可接受的性能。例如,我们可以轻松校准给定工作平台组合应使用的最大处理器数量。我们还考虑了几种算法变体的影响,如同时转移工作或避免无用转移的阈值。我们所有的结果都通过仿真验证了广泛的参数。

英文摘要:

We study in this paper the impact of communication latency on the classical Work Stealing load balancing algorithm. Our approach considers existing performance models and the underlying algorithms. We introduce a latency parameter in the model and study its overall impact by careful observations of simulation results. Using this method we are able to derive a new expression of the expected running time of divisible load applications. This expression enables us to predict under which conditions a given run will yield acceptable performance. For instance, we can easily calibrate the maximal number of processors one should use for a given work platform combination. We also consider the impact of several algorithmic variants like simultaneous transfers of work or thresholds for avoiding useless transfers. All our results are validated through simulation on a wide range of parameters.

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

↑