Immediate mode scheduling in grid systems Online publication date: Sun, 17-Jun-2007
by Fatos Xhafa, Javier Carretero, Leonard Barolli, Arjan Durresi
International Journal of Web and Grid Services (IJWGS), Vol. 3, No. 2, 2007
Abstract: Computational Grids (CGs) are nowadays successfully responding to increasing needs for high computation power. A key issue in CGs is the scheduling, which demands for efficient methods. In this work, we consider the scheduling problem in immediate mode, in which jobs are allocated as soon as they arrive in the system. This type of scheduling arises in many grid-based applications, especially, in real-time applications. We have implemented five immediate scheduling methods and have measured their performance with respect to four parameters: makespan, flowtime, resource utilisation and matching proximity by using a simulation benchmark for heterogeneous distributed systems. The computational results showed the performance of the immediate scheduling methods and allowed us to evaluate the advantages of these methods if we knew in advance certain grid characteristics (consistency of computing, heterogeneity of jobs and resources). The usefulness of the presented methods in web and grid scheduling services is also discussed.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
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 Web and Grid Services (IJWGS):
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 subs@inderscience.com
Our Blog 
Follow us on Twitter 
Visit us on Facebook