Scheduling with uncertainties on new computing platforms

Abstract : New distributed computing platforms (grids) are based on interconnections of a large number of processing elements. A most important issue for their effective utilization is the optimal use of resources through proper task scheduling. It consists of allocating the tasks of a parallel program to processors on the platform and to determine at what time the tasks will start their execution. As data may be subject to uncertainties or disturbances, it is practically impossible to precisely predict the input parameters of the task scheduling problem. We briefly survey existing approaches for dealing with data uncertainties and discuss their relevance in the context of grid computing. We describe the stabilization process and analyze a scheduling algorithm that is intrinsically stable (i.e., it mitigates the effects of disturbances in input data at runtime). This algorithm is based on a decomposition of the application graph into convex sets of vertices. Finally, it is compared experimentally to pure on-line and well-known off-line algorithms.
Type de document :
Article dans une revue
Computational Optimization and Applications, Springer Verlag, 2011, 48 (2), pp.369-398. 〈10.1007/s10589-009-9311-0〉
Liste complète des métadonnées

https://hal.inria.fr/hal-00796862
Contributeur : Grégory Mounié <>
Soumis le : mardi 5 mars 2013 - 11:05:54
Dernière modification le : jeudi 11 janvier 2018 - 06:22:02

Lien texte intégral

Identifiants

Collections

Citation

Amine Mahjoub, Jonathan E. Pecero-Sanchez, Denis Trystram. Scheduling with uncertainties on new computing platforms. Computational Optimization and Applications, Springer Verlag, 2011, 48 (2), pp.369-398. 〈10.1007/s10589-009-9311-0〉. 〈hal-00796862〉

Partager

Métriques

Consultations de la notice

232