# Comments on Design and performance evaluation of load distribution strategies for multiple loads on heterogeneous linear daisy chain networks''

2 GRAAL - Algorithms and Scheduling for Distributed Heterogeneous Platforms
Inria Grenoble - Rhône-Alpes, LIP - Laboratoire de l'Informatique du Parallélisme
Abstract : Min, Veeravalli, and Barlas 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 the proposed 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 scheduling for any instance, once the number of installments per load is given. Finally, we formally prove that under a linear cost model, as in the original paper, an optimal schedule has an infinite number of installments. Such a cost model can therefore not be sed to design practical multi-installment strategies.
Keywords :
Document type :
Reports

https://hal.inria.fr/inria-00130294
Contributor : Frédéric Vivien <>
Submitted on : Saturday, February 10, 2007 - 6:22:53 PM
Last modification on : Monday, November 16, 2020 - 9:56:03 AM
Long-term archiving on: : Tuesday, April 6, 2010 - 11:46:47 PM

### Files

SchedulingDivisible.pdf
Files produced by the author(s)

### Citation

Matthieu Gallet, Yves Robert, Frédéric Vivien. Comments on Design and performance evaluation of load distribution strategies for multiple loads on heterogeneous linear daisy chain networks''. [Research Report] 2007. ⟨inria-00130294v1⟩

Record views