Computer Science – Distributed – Parallel – and Cluster Computing
Scientific paper
2004-05-04
ACM Symposium on Parallel Algorithms and Architectures (2004) 125-132
Computer Science
Distributed, Parallel, and Cluster Computing
Scientific paper
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.
Dutot Pierre-Francois
Eyraud Lionel
Mounié Grégory
Trystram Denis
No associations
LandOfFree
Bi-criteria Algorithm for Scheduling Jobs on Cluster Platforms does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Bi-criteria Algorithm for Scheduling Jobs on Cluster Platforms, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Bi-criteria Algorithm for Scheduling Jobs on Cluster Platforms will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-346116