Balanced fair resource sharing in computer clusters

Thomas Bonald; Céline Comte

doi:10.1016/j.peva.2017.08.006

Balanced fair resource sharing in computer clusters

Thomas Bonald
, Céline Comte

Research output: Contribution to journal › Article › Academic › peer-review

32 Citations (Scopus)

18 Downloads (Pure)

Abstract

We represent a computer cluster as a multi-server queue with some arbitrary bipartite 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 service capacity.

Original language	English
Pages (from-to)	70-83
Journal	Performance Evaluation
Volume	116
DOIs	https://doi.org/10.1016/j.peva.2017.08.006
Publication status	Published - 22 Apr 2016
Externally published	Yes

Keywords

Parallel processing
Scheduling algorithm
Queueing theory

Access to Document

10.1016/j.peva.2017.08.006

1604.06763v3Final author version , 775 KB

Cite this

@article{0c441d9e07db4b77be8a33135af469ce,

title = "Balanced fair resource sharing in computer clusters",

abstract = "We represent a computer cluster as a multi-server queue with some arbitrary bipartite 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 service capacity. ",

keywords = "Parallel processing, Scheduling algorithm, Queueing theory",

author = "Thomas Bonald and C{\'e}line Comte",

year = "2016",

month = apr,

day = "22",

doi = "10.1016/j.peva.2017.08.006",

language = "English",

volume = "116",

pages = "70--83",

journal = "Performance Evaluation",

issn = "0166-5316",

publisher = "Elsevier B.V.",

}

TY - JOUR

T1 - Balanced fair resource sharing in computer clusters

AU - Bonald, Thomas

AU - Comte, Céline

PY - 2016/4/22

Y1 - 2016/4/22

N2 - We represent a computer cluster as a multi-server queue with some arbitrary bipartite 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 service capacity.

AB - We represent a computer cluster as a multi-server queue with some arbitrary bipartite 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 service capacity.

KW - Parallel processing

KW - Scheduling algorithm

KW - Queueing theory

U2 - 10.1016/j.peva.2017.08.006

DO - 10.1016/j.peva.2017.08.006

M3 - Article

SN - 0166-5316

VL - 116

SP - 70

EP - 83

JO - Performance Evaluation

JF - Performance Evaluation

ER -

Balanced fair resource sharing in computer clusters

Abstract

Keywords

Access to Document

Fingerprint

Cite this