Cluster Computing and the Grid, IEEE International Symposium on (2007)
Rio De Janeiro, Brazil
May 14, 2007 to May 17, 2007
Lior Amar , Hebrew University of Jerusalem
Amnon Barak , Hebrew University of Jerusalem
Ely Levy , Hebrew University of Jerusalem
Michael Okun , Weizmann Institute of Science, Israel
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).
M. Okun, A. Barak, E. Levy and L. Amar, "An On-line Algorithm for Fair-Share Node Allocations in a Cluster," Cluster Computing and the Grid, IEEE International Symposium on(CCGRID), Rio De Janeiro, Brazil, 2007, pp. 83-91.