An on-line algorithm for fair-share node allocations in a cluster

Lior Amar; Amnon Barak; Ely Levy; Michael Okun

doi:10.1109/CCGRID.2007.22

An on-line algorithm for fair-share node allocations in a cluster

Lior Amar^*, Amnon Barak, Ely Levy, Michael Okun

^*Corresponding author for this work

The Rachel and Selim Benin School of Engineering and Computer Science

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

14 Scopus citations

Abstract

Proportional (fair) share schedulers are designed to provide applications with predefined portions of system resources. Single node operating systems use context-switch (preemption) to dynamically allocate the CPU(s) to running processes. This paper presents an on-line algorithm for proportional share allocations of nodes in a cluster, in a fashion that resembles a single-node system. The algorithm relies on preemptive process migrations for dynamic allocations of nodes to users. The paper presents the algorithm and its performance on a MOSIX organizational Grid with 60 nodes. We show that proportional share allocations can be achieved in a relatively short time (minutes).

Original language	English
Title of host publication	Proceedings - Seventh IEEE International Symposium on Cluster Computing and the Grid, CCGrid 2007
Pages	83-91
Number of pages	9
DOIs	https://doi.org/10.1109/CCGRID.2007.22
State	Published - 2007
Event	7th IEEE International Symposium on Cluster Computing and the Grid, CCGrid 2007 - Rio de Janeiro, Brazil Duration: 14 May 2007 → 17 May 2007

Publication series

Name	Proceedings - Seventh IEEE International Symposium on Cluster Computing and the Grid, CCGrid 2007

Conference

Conference	7th IEEE International Symposium on Cluster Computing and the Grid, CCGrid 2007
Country/Territory	Brazil
City	Rio de Janeiro
Period	14/05/07 → 17/05/07

Keywords

Cluster and grid computing
Fair-share allocations
Grid management
Proportional share algorithms

Access to Document

10.1109/CCGRID.2007.22

Cite this

Amar, L., Barak, A., Levy, E., & Okun, M. (2007). An on-line algorithm for fair-share node allocations in a cluster. In Proceedings - Seventh IEEE International Symposium on Cluster Computing and the Grid, CCGrid 2007 (pp. 83-91). Article 4215369 (Proceedings - Seventh IEEE International Symposium on Cluster Computing and the Grid, CCGrid 2007). https://doi.org/10.1109/CCGRID.2007.22

@inproceedings{1a8f8afa5b524044bb15c31f58329e41,

title = "An on-line algorithm for fair-share node allocations in a cluster",

abstract = "Proportional (fair) share schedulers are designed to provide applications with predefined portions of system resources. Single node operating systems use context-switch (preemption) to dynamically allocate the CPU(s) to running processes. This paper presents an on-line algorithm for proportional share allocations of nodes in a cluster, in a fashion that resembles a single-node system. The algorithm relies on preemptive process migrations for dynamic allocations of nodes to users. The paper presents the algorithm and its performance on a MOSIX organizational Grid with 60 nodes. We show that proportional share allocations can be achieved in a relatively short time (minutes).",

keywords = "Cluster and grid computing, Fair-share allocations, Grid management, Proportional share algorithms",

author = "Lior Amar and Amnon Barak and Ely Levy and Michael Okun",

year = "2007",

doi = "10.1109/CCGRID.2007.22",

language = "אנגלית",

isbn = "0769528333",

series = "Proceedings - Seventh IEEE International Symposium on Cluster Computing and the Grid, CCGrid 2007",

pages = "83--91",

booktitle = "Proceedings - Seventh IEEE International Symposium on Cluster Computing and the Grid, CCGrid 2007",

note = "7th IEEE International Symposium on Cluster Computing and the Grid, CCGrid 2007 ; Conference date: 14-05-2007 Through 17-05-2007",

}

Amar, L, Barak, A, Levy, E & Okun, M 2007, An on-line algorithm for fair-share node allocations in a cluster. in Proceedings - Seventh IEEE International Symposium on Cluster Computing and the Grid, CCGrid 2007., 4215369, Proceedings - Seventh IEEE International Symposium on Cluster Computing and the Grid, CCGrid 2007, pp. 83-91, 7th IEEE International Symposium on Cluster Computing and the Grid, CCGrid 2007, Rio de Janeiro, Brazil, 14/05/07. https://doi.org/10.1109/CCGRID.2007.22

An on-line algorithm for fair-share node allocations in a cluster. / Amar, Lior; Barak, Amnon; Levy, Ely et al.
Proceedings - Seventh IEEE International Symposium on Cluster Computing and the Grid, CCGrid 2007. 2007. p. 83-91 4215369 (Proceedings - Seventh IEEE International Symposium on Cluster Computing and the Grid, CCGrid 2007).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - An on-line algorithm for fair-share node allocations in a cluster

AU - Amar, Lior

AU - Barak, Amnon

AU - Levy, Ely

AU - Okun, Michael

PY - 2007

Y1 - 2007

N2 - Proportional (fair) share schedulers are designed to provide applications with predefined portions of system resources. Single node operating systems use context-switch (preemption) to dynamically allocate the CPU(s) to running processes. This paper presents an on-line algorithm for proportional share allocations of nodes in a cluster, in a fashion that resembles a single-node system. The algorithm relies on preemptive process migrations for dynamic allocations of nodes to users. The paper presents the algorithm and its performance on a MOSIX organizational Grid with 60 nodes. We show that proportional share allocations can be achieved in a relatively short time (minutes).

AB - Proportional (fair) share schedulers are designed to provide applications with predefined portions of system resources. Single node operating systems use context-switch (preemption) to dynamically allocate the CPU(s) to running processes. This paper presents an on-line algorithm for proportional share allocations of nodes in a cluster, in a fashion that resembles a single-node system. The algorithm relies on preemptive process migrations for dynamic allocations of nodes to users. The paper presents the algorithm and its performance on a MOSIX organizational Grid with 60 nodes. We show that proportional share allocations can be achieved in a relatively short time (minutes).

KW - Cluster and grid computing

KW - Fair-share allocations

KW - Grid management

KW - Proportional share algorithms

UR - http://www.scopus.com/inward/record.url?scp=34548357173&partnerID=8YFLogxK

U2 - 10.1109/CCGRID.2007.22

DO - 10.1109/CCGRID.2007.22

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

AN - SCOPUS:34548357173

SN - 0769528333

SN - 9780769528335

T3 - Proceedings - Seventh IEEE International Symposium on Cluster Computing and the Grid, CCGrid 2007

SP - 83

EP - 91

BT - Proceedings - Seventh IEEE International Symposium on Cluster Computing and the Grid, CCGrid 2007

T2 - 7th IEEE International Symposium on Cluster Computing and the Grid, CCGrid 2007

Y2 - 14 May 2007 through 17 May 2007

ER -

An on-line algorithm for fair-share node allocations in a cluster

Abstract

Publication series

Conference

Keywords

Access to Document

Other files and links

Fingerprint

Cite this