A novel service scheduling policy based on logical subnet partitioning in Bio-Grid environments
by Wenchao Jiang, Yanhong Zhou, Hai Jin, Matthias Baumgarten
International Journal of Grid and Utility Computing (IJGUC), Vol. 2, No. 2, 2011

Abstract: In this paper, we present a method called SP2SP, 2-level Grid Service Scheduling Policy based on Logical Subnet Partitioning (LSP), which tackles the service scheduling problem in Bio-Grid environments through three steps: (a) a similarity-based logical subnet partitioning algorithm which classifies individual services into different subsets according to similarity constraints that are based on performance metrics; (b) the employment of a requirement-based prediction algorithm that maps the bioinformatics applications that are composed of multiple sub-tasks into optimal subnet and (c) multi-priority queue-based service scheduling algorithm used inside individual subnet taking charge of allocating each sub-task to an optimal physical service within the subnet. Based on the sub-grid platform of NPPC, experimental results have shown that SP2SP outperforms other scheduling algorithms. In particular, SP2SP performs best for scenarios where a group of tasks has similar resource requirements or need to cooperate with each other to obtain better performance as a whole.

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