Two linear programming formulations for scheduling multi-user periodic arrival tasks

Abstract : Grid scheduling handles periodic arrival of jobs by many users. A set of users share some homogeneous machines and each user has a set of independant generic periodic jobs. We tackle this problem with two linear programming models. The first one models the transitory part of a schedule until it reaches its periodic pattern. The second one models directly the schedule periodic pattern. Fairness is an important issue for grid management to avoid being congested by few users. We suggest many criteria to measure the load induced by user jobs. These criteria should favor the schedule fairness.
keyword : Grid
Type de document :
Communication dans un congrès
EURO 2009 - 23rd European Conference on Operational Research, Jul 2009, Bonn, Germany. pp.1-3, 2009


http://hal.in2p3.fr/in2p3-00403426
Contributeur : Jeanine Pellet <>
Soumis le : vendredi 10 juillet 2009 - 11:56:01
Dernière modification le : lundi 31 octobre 2016 - 17:28:31
Document(s) archivé(s) le : mardi 15 juin 2010 - 19:51:34

Fichier

Bonn.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

  • HAL Id : in2p3-00403426, version 1

Citation

Emmanuel Medernach, Claire Hanen, Philippe Lacomme, Eric Sanlaville. Two linear programming formulations for scheduling multi-user periodic arrival tasks. EURO 2009 - 23rd European Conference on Operational Research, Jul 2009, Bonn, Germany. pp.1-3, 2009. <in2p3-00403426>

Exporter

Partager

Métriques

Consultations de
la notice

180

Téléchargements du document

149