Grid brokering for batch allocation using indexes

Vandy Berten 1 Bruno Gaujal 2
2 MESCAL - Middleware efficiently scalable
Inria Grenoble - Rhône-Alpes, LIG - Laboratoire d'Informatique de Grenoble
Abstract : In this paper we show how dynamic brokering for batch allocation in grids based on bi-dimensional indices can be used in practice in computational grids, with or without knowing the sizes of the jobs. We provide a fast algorithm (with a quadratic complexity) which can be used off-line or even on-line to compute the index tables. We also report numerous simulations providing numerical evidence of the great efficiency of our index routing policy as well as its robustness with respect to parameter changes. The value of information is also assessed by comparing the performance of indexes when the sizes of the jobs are known and when they are not known.
Type de document :
Communication dans un congrès
Springer. NET-COOP 2007 : First EuroFGI International Conference on Network Control and Optimization, Jun 2007, Avignon, France. Springer, 4465, pp.215-225, 2007, LNCS. 〈10.1007/978-3-540-72709-5〉
Liste complète des métadonnées

https://hal.inria.fr/hal-00689546
Contributeur : Ist Rennes <>
Soumis le : jeudi 19 avril 2012 - 16:31:25
Dernière modification le : mercredi 11 avril 2018 - 01:54:21

Identifiants

Collections

Citation

Vandy Berten, Bruno Gaujal. Grid brokering for batch allocation using indexes. Springer. NET-COOP 2007 : First EuroFGI International Conference on Network Control and Optimization, Jun 2007, Avignon, France. Springer, 4465, pp.215-225, 2007, LNCS. 〈10.1007/978-3-540-72709-5〉. 〈hal-00689546〉

Partager

Métriques

Consultations de la notice

141