Level-based batch scheduling strategies for computational grid Online publication date: Wed, 29-Oct-2014
by Mohammad Shahid; Zahid Raza
International Journal of Grid and Utility Computing (IJGUC), Vol. 5, No. 2, 2014
Abstract: Grid computing is a high performance computing environment that allows sharing of geographically distributed resources across multiple administrative domains serving the ever growing demand for computational power. Scheduling m jobs to n resources to optimise the QoS for the given objective parameters has been proven to be NP-complete. This work presents two centralised level based batch scheduling strategies for a computational grid with the objective of minimising the turnaround time. The scheduler evaluates various computational nodes to schedule the batch of jobs consisting of a number of sub-jobs/modules having precedence and dependence constraints along with inter module communication requirements. Minimum Completion Time (MCT) and Minimum Execution Time (MET) heuristics have been used to decide the most suitable node for the given sub-job in terms of the turnaround time offered. A comparative analysis of the strategies with a model with similar objective has been performed to evaluate their place in the middleware.
Online publication date: Wed, 29-Oct-2014
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 Grid and Utility Computing (IJGUC):
Login with your Inderscience username and 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 email@example.com