Fair Grid Scheduling

Abstract : Computing grids allow sharing of distributed resources such as CPU or storage to the service of many scientific communities. Users submit irregular bursts of jobs. This irregula rusage of the grid allow an efficient sharing of resources because unused resources can be collected this way. Jobs are mono-processors and arrive on-line to clusters. Jobs on a cluster are independents, they could be run in any order. Pre-emption is not used because of memory and communication costs.
Type de document :
Poster
3rd EGEE User Forum, Feb 2008, Clermont-Ferrand


http://hal.in2p3.fr/in2p3-00336878
Contributeur : Jeanine Pellet <>
Soumis le : mercredi 5 novembre 2008 - 14:06:32
Dernière modification le : mercredi 5 novembre 2008 - 15:04:08

Identifiants

  • HAL Id : in2p3-00336878, version 1

Citation

E. Medernach. Fair Grid Scheduling. 3rd EGEE User Forum, Feb 2008, Clermont-Ferrand. <in2p3-00336878>

Exporter

Partager

Métriques

Consultations de la notice

66