Scheduling multiple divisible loads on a linear processor network

Abstract : 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.
Complete list of metadatas

https://hal.inria.fr/inria-00158027
Contributor : Rapport de Recherche Inria <>
Submitted on : Thursday, June 28, 2007 - 5:01:40 PM
Last modification on : Friday, April 20, 2018 - 3:44:24 PM
Long-term archiving on : Tuesday, September 21, 2010 - 1:52:58 PM

Files

RR-6235.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : inria-00158027, version 2
  • ARXIV : 0706.4038

Collections

Citation

Matthieu Gallet, Yves Robert, Frédéric Vivien. Scheduling multiple divisible loads on a linear processor network. [Research Report] RR-6235, INRIA. 2007. ⟨inria-00158027v2⟩

Share

Metrics

Record views

458

Files downloads

182