This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Seventh IEEE International Symposium on Cluster Computing and the Grid (CCGrid '07)
An On-line Algorithm for Fair-Share Node Allocations in a Cluster
Rio De Janeiro, Brazil
May 14-May 17
ISBN: 0-7695-2833-3
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).
Citation:
Lior Amar, Amnon Barak, Ely Levy, Michael Okun, "An On-line Algorithm for Fair-Share Node Allocations in a Cluster," ccgrid, pp.83-91, Seventh IEEE International Symposium on Cluster Computing and the Grid (CCGrid '07), 2007
Usage of this product signifies your acceptance of the Terms of Use.