Robust scheduling of moldable parallel jobs
by Sudha Srinivasan, Savitha Krishnamoorthy, P. Sadayappan
International Journal of High Performance Computing and Networking (IJHPCN), Vol. 2, No. 2/3/4, 2004

Abstract: Moldable job scheduling has been shown to be promising compared with traditional job scheduling policies. In contrast to rigid job scheduling where the number of processors for a job is fixed by the user, with moldable job scheduling the number of processors allocated to each job is chosen by the scheduler from a given range. Using simulation-based experiments, we show that previously proposed moldable scheduling strategies are not very robust – overall performance improves in some circumstances, but worsens under other circumstances, and considerably degrades performance for some categories of jobs. This paper proposes a more robust strategy for scheduling moldable jobs, which outperforms the rigid scheduling scheme and previous moldable scheduling strategies. The new strategy performs well under different load conditions and for jobs of different scalabilities.

Online publication date: Thu, 02-Feb-2006

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of High Performance Computing and Networking (IJHPCN):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com