Balanced fair resource sharing in computer clusters

被引：26

作者：

Bonald, Thomas ^{[1
]}

Comte, Celine ^{[1
,2
]}

机构：

[1] Univ Paris Saclay, Telecom ParisTech, Orsay, France

[2] Nokia Bell Labs, Nozay, France

来源：

PERFORMANCE EVALUATION | 2017年 / 116卷

关键词：

Parallel processing; Multi-server queues; Balanced fairness; Order independent queues; Whittle networks; NETWORKS;

D O I：

10.1016/j.peva.2017.08.006

中图分类号：

TP3 [计算技术、计算机技术];

学科分类号：

0812 ;

摘要：

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. (C) 2017 Elsevier B.V. All rights reserved.

引用

页码：70 / 83

页数：14

共 27 条

[1]

Adan I., 2014, EVALUATION REV, V41, P22

[2] OPEN, CLOSED, AND MIXED NETWORKS OF QUEUES WITH DIFFERENT CLASSES OF CUSTOMERS [J].