Skip to Main content Skip to Navigation
Journal articles

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.
Complete list of metadatas

Cited literature [27 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-01581786
Contributor : Thomas Bonald <>
Submitted on : Tuesday, September 5, 2017 - 10:17:41 AM
Last modification on : Friday, December 20, 2019 - 10:14:03 AM

File

peva2017.pdf
Files produced by the author(s)

Identifiers

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⟩

Share

Metrics

Record views

474

Files downloads

390