Toward a Fully Decentralized Algorithm for Multiple Bag-of-tasks Application Scheduling on Grids

Rémi Bertin 1, 2 Arnaud Legrand 2, 1, * Corinne Touati 2, 1
* Auteur correspondant
1 MESCAL - Middleware efficiently scalable
Inria Grenoble - Rhône-Alpes, LIG - Laboratoire d'Informatique de Grenoble
Abstract : In this paper, we present a fully decentralized algorithm for fair resource sharing between multiple bag-of-tasks applications in a grid environment. This algorithm is inspired from related work on multi-path routing in communication network. An interesting feature of this algorithm is that it allows the choice of wide variety of fairness criteria and achieves both optimal path selection and flow control. In addition, this algorithm only requires local information at each slave computing tasks and at each buffer of the network links while minimal computation is done by the schedulers. A naive adaptation is unstable and inefficient though. Fortunately, a simple and effective scaling mechanism is sufficient to circumvent this issue. This scaling mechanism is motivated by a careful study of the subtle differences with the classical multi-path routing problem. We prove its efficiency through a detailed analysis of a simple simulation.
Type de document :
[Research Report] INRIA. 2008, pp.27
Liste complète des métadonnées

Littérature citée [1 références]  Voir  Masquer  Télécharger
Contributeur : Rapport de Recherche Inria <>
Soumis le : lundi 19 mai 2008 - 10:35:39
Dernière modification le : samedi 17 septembre 2016 - 01:38:19
Document(s) archivé(s) le : vendredi 25 novembre 2016 - 23:05:07


Fichiers produits par l'(les) auteur(s)


  • HAL Id : inria-00279993, version 2



Rémi Bertin, Arnaud Legrand, Corinne Touati. Toward a Fully Decentralized Algorithm for Multiple Bag-of-tasks Application Scheduling on Grids. [Research Report] INRIA. 2008, pp.27. 〈inria-00279993v2〉



Consultations de
la notice


Téléchargements du document