Minimizing the Stretch When Scheduling Flows of Divisible Requests

Arnaud Legrand 1 Alan Su 2 Frédéric Vivien 3, 4
1 MESCAL - Middleware efficiently scalable
Inria Grenoble - Rhône-Alpes, LIG - Laboratoire d'Informatique de Grenoble
3 GRAAL - Algorithms and Scheduling for Distributed Heterogeneous Platforms
Inria Grenoble - Rhône-Alpes, LIP - Laboratoire de l'Informatique du Parallélisme
Abstract : In this paper, we consider the problem of scheduling distributed biological sequence comparison applications. This problem lies in the divisible load framework with negligible communication costs. Thus far, very few results have been proposed for this model. We discuss and select relevant metrics for this framework: namely max-stretch and sum-stretch. We explain the relationship between our model and the preemptive single processor case, and we show how to extend algorithms that have been proposed in the literature for the single processor model to the divisible multi-processor problem domain. We recall known results on closely related problems, we show how to minimize the max-stretch on unrelated machines either in the divisible load model or with preemption, we derive new lower bounds on the competitive ratio of any online algorithm, we present new competitiveness results for existing algorithms, and we develop several new online heuristics. We also address the Pareto optimization of max-stretch. Then, we extensively study the performance of these algorithms and heuristics under realistic scenarios. Our study shows that all previously proposed guaranteed heuristics for max-stretch for the single processor model are inefcient in practice. In contrast, we show that our online algorithms based on linear programming are in practice near-optimal solutions for max-stretch. Our study also clearly suggests heuristics that are efcient for both metrics, although a combined optimization is in theory not possible in the general case.
Type de document :
Article dans une revue
Journal of Scheduling, Springer Verlag, 2008, <10.1007/s10951-008-0078-4>
Liste complète des métadonnées
Contributeur : Arnaud Legrand <>
Soumis le : lundi 18 février 2013 - 11:44:48
Dernière modification le : mercredi 14 décembre 2016 - 01:09:21




Arnaud Legrand, Alan Su, Frédéric Vivien. Minimizing the Stretch When Scheduling Flows of Divisible Requests. Journal of Scheduling, Springer Verlag, 2008, <10.1007/s10951-008-0078-4>. <hal-00789419>



Consultations de la notice