By Topic

A Multi-constraint Preemption Algorithm for Parallel Job Scheduling

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Luo Hongbing ; High Performance Comput. Center, Inst. of Appl. Phys. & Computional Math., Beijing, China ; Wu Linping ; Wang Wei

Using effective scheduling strategies to improve turnaround time, slowdown, and utilization is an important consideration in large supercomputing environments. Since such machines have traditionally used non-preemption strategies to accommodate multiple jobs at the same time, a number of questions remain unanswered regarding the practical effect of preemptive scheduling. In this paper, we first discuss how to improve the turnaround time, slowdown, and utilization using an appropriate suspension criterion. We then develop a new multi-constraint preemptive scheduling algorithm (MCPS). Finally, we describe the experiments on a simulator with several realistic workloads. The experimental results show that MCPS is better than the conventional no-preemption strategies, and outperforms other preemptive scheduling strategies by its balanced performance.

Published in:

2011 12th International Conference on Parallel and Distributed Computing, Applications and Technologies

Date of Conference:

20-22 Oct. 2011