Balanced Fair Resource Sharing in Computer Clusters - Archive ouverte HAL Access content directly
Journal Articles Performance Evaluation Year : 2017

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.
Fichier principal
Vignette du fichier
peva2017.pdf (631.55 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

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

Identifiers

Cite

Thomas Bonald, Céline Comte. Balanced Fair Resource Sharing in Computer Clusters. Performance Evaluation, 2017, ⟨10.1016/j.peva.2017.08.006⟩. ⟨hal-01581786⟩
308 View
277 Download

Altmetric

Share

Gmail Facebook X LinkedIn More