Balanced Fair Resource Sharing in Computer Clusters

Abstract : 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.
Type de document :
Article dans une revue
Performance Evaluation, Elsevier, 2017, <10.1016/j.peva.2017.08.006>
Liste complète des métadonnées


https://hal.archives-ouvertes.fr/hal-01581786
Contributeur : Thomas Bonald <>
Soumis le : mardi 5 septembre 2017 - 10:17:41
Dernière modification le : jeudi 7 septembre 2017 - 01:08:27

Fichier

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

Identifiants

Citation

Thomas Bonald, Céline Comte. Balanced Fair Resource Sharing in Computer Clusters. Performance Evaluation, Elsevier, 2017, <10.1016/j.peva.2017.08.006>. <hal-01581786>

Partager

Métriques

Consultations de
la notice

77

Téléchargements du document

7