Scheduling multiple divisible loads on a linear processor network - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Rapport (Rapport De Recherche) Année : 2007

Scheduling multiple divisible loads on a linear processor network

Résumé

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.
Fichier principal
Vignette du fichier
RR-6235.pdf (252.3 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

inria-00158027 , version 1 (27-06-2007)
inria-00158027 , version 2 (28-06-2007)

Identifiants

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

Citer

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⟩
184 Consultations
150 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More