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

线性处理器网络上的多个可分负载调度

Scheduling multiple divisible loads on a linear processor network

Matthieu Gallet, Yves Robert, Frédéric Vivien

摘要:

Min、Veeravalli和Barlas最近提出了一种策略,可以使用一个或多个分期付款来最小化异构线性网络上一个或多个可分割负载的总执行时间。我们展示了一个非常简单的例子,他们的方法并不总是产生一个解决方案,当它,解决方案往往是次优的。我们还展示了如何找到一个最佳的时间表,任何情况下,一旦每个负载的分期付款的数量。然后,我们正式声明,任何最优的时间表有无限数量的分期付款下的线性成本模型中假设的原始文件。因此,这样的成本模型不能用于设计实际的多分期付款战略。最后,通过大量的模拟,我们证实了最好的解决方案总是产生的线性规划方法,而解决方案的原始文件可以远离最优。

英文摘要:

Min, Veeravalli, and Barlas have recently proposed strategies to minimize the overall execution time of one or several divisible loads on a heterogeneous linear network, using one or more installments. We show on a very simple example that their approach does not always produce a solution and that, when it does, the solution is often suboptimal. We also show how to find an optimal schedule for any instance, once the number of installments per load is given. Then, we formally state that any optimal schedule has an infinite number of installments under a linear cost model as the one assumed in the original papers. Therefore, such a cost model cannot be used to design practical multi-installment strategies. Finally, through extensive simulations we confirmed that the best solution is always produced by the linear programming approach, while solutions of the original papers can be far away from the optimal.

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

↑