Article Dans Une Revue Performance Evaluation Année : 2017

Balanced Fair Resource Sharing in Computer Clusters

Résumé

We represent a computer cluster as a multi-server queue with some arbitrary graph of compatibilities between jobs and servers. Each server processes its jobs sequentially in FCFS order. The service rate of a job at any given time is the sum of the service rates of all servers processing this job. We show that the corresponding queue is quasi-reversible and use this property to design a scheduling algorithm achieving balanced fair sharing of the computing resources.

Fichier principal
Vignette du fichier
peva2017.pdf (631.55 Ko) Télécharger le fichier
Origine Fichiers produits par l'(les) auteur(s)
Licence
Loading...

Dates et versions

hal-01581786 , version 1 (05-09-2017)

Licence

Identifiants

Citer

Thomas Bonald, Céline Comte. Balanced Fair Resource Sharing in Computer Clusters. Performance Evaluation, 2017, ⟨10.1016/j.peva.2017.08.006⟩. ⟨hal-01581786⟩
472 Consultations
542 Téléchargements

Altmetric

Partager

  • More