We study the impact of communication latency on the classical Work Stealing load balancing algorithm. Our paper extends the reference model in which we introduce a latency parameter. By using a theoretical analysis and simulation, we study the overall impact of this latency on the Makespan (maximum completion time). We derive a new expression of the expected running time of a bag of independent tasks scheduled by Work Stealing. 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 to use for a given work/platform combination. All our results are validated through simulation on a wide range of parameters.

我们研究了通信延迟对经典的工作窃取负载平衡算法的影响。我们的论文扩展了引入延迟参数的参考模型。通过理论分析和仿真，我们研究了此延迟对Makespan的总体影响（最大完成时间）。我们得出了工作窃取计划的一包独立任务的预期运行时间的新表达式。该表达式使我们能够预测给定运行将在何种条件下产生可接受的性能。例如，我们可以轻松地校准用于给定工作/平台组合的处理器的最大数量。我们所有的结果都通过对各种参数的仿真得到了验证。