Job-scheduling via resource availability prediction for volunteer computational grids
by Jun Zhang, Chris Phillips
International Journal of Grid and Utility Computing (IJGUC), Vol. 2, No. 1, 2011

Abstract: In a volunteer-based computational grid computing, one big challenge for effective job allocation is resource availability. As resources in this environment are volatile, matching guest jobs to suitable resources is very important. To improve scheduling, especially in terms of avoiding job failures due to resource unavailability, we propose a new job-scheduling algorithm called first-come-first-served plus predictor (FCFSPP). This scheduling algorithm is based on an existing resource availability prediction method that anticipates the future availability of resources to help make reliable job allocation decisions. According to the simulation results, FCFSPP does not only reduce the number of job failures but also maintain acceptable job throughput in volatile volunteer environments by providing reliable job allocation decisions.

Online publication date: Sat, 28-Mar-2015

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 Grid and Utility Computing (IJGUC):
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