Paper Info
Title
Bi-criteria algorithm for scheduling jobs on cluster platforms
Abstract
We describe in this paper a new method for building an efficient algorithm for scheduling jobs in a cluster. Jobs are considered as parallel tasks (PT) which can be scheduled on any number of processors. The main feature is to consider two criteria that are optimized together. These criteria are the makespan and the weighted minimal average completion time (minsum). They are chosen for their complementarity, to be able to represent both user-oriented objectives and system administrator objectives.We propose an algorithm based on a batch policy with increasing batch sizes, with a smart selection of jobs in each batch. This algorithm is assessed by intensive simulation results, compared to a new lower bound (obtained by a relaxation of ILP) of the optimal schedules for both criteria separately. It is currently implemented in an actual real-size cluster platform.
Year
DOI
Venue
2004
10.1145/1007912.1007932
acm symposium on parallel algorithms and architectures
Keywords
DocType
Volume
intensive simulation result,smart selection,main feature,parallel computing,batch policy,parallel task,parallel tasks,efficient algorithm,scheduling,optimal schedule,bi-criteria,moldable tasks,actual real-size cluster platform,new method,bi-criteria algorithm,algorithms,batch size,lower bound,parallel computer
Conference
cs.DC/0405006
ISSN
ISBN
Citations 
ACM Symposium on Parallel Algorithms and Architectures (2004) 125-132
1-58113-840-7
27
PageRank 
References 
Authors
1.08
17
4
Name
Order
Citations
PageRank
Pierre-françois Dutot116613.95
Lionel Eyraud2595.07
Grégory Mounié31289.68
Denis Trystram41120160.57