An On-line Algorithm for Fair-Share Node Allocations in a Cluster

Author

Amar, Lior ; Barak, Amnon ; Levy, Ely ; Okun, Michael

Author_Institution

Dept. of Comput. Sci., Hebrew Univ. of Jerusalem, Jerusalem

fYear

2007

fDate

14-17 May 2007

Firstpage

83

Lastpage

91

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 online 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

grid computing; operating systems (computers); resource allocation; scheduling; workstation clusters; MOSIX organizational grid; cluster computing; context-switching; fair-share node allocation; online algorithm; preemptive process migration; proportional share scheduler; single node operating system; Clustering algorithms; Computer science; Grid computing; Operating systems; Partitioning algorithms; Processor scheduling; Resource management; Scheduling algorithm; Time sharing computer systems; Virtual manufacturing;

fLanguage

English

Publisher

ieee

Conference_Titel

Cluster Computing and the Grid, 2007. CCGRID 2007. Seventh IEEE International Symposium on

Conference_Location

Rio De Janeiro

Print_ISBN

0-7695-2833-3

Type

conf

DOI

10.1109/CCGRID.2007.22

Filename

4215369