Title: A novel service scheduling policy based on logical subnet partitioning in Bio-Grid environments

Authors: Wenchao Jiang, Yanhong Zhou, Hai Jin, Matthias Baumgarten

Addresses: School of Information Engineering, Guangdong University of Technology, Guangzhou 510006, China; School of Computer Science and Technology, Huazhong University of Science and Technology, Wuhan 430074, China. ' School of Computer Science and Technology, Huazhong University of Science and Technology, Wuhan 430074, China. ' School of Computer Science and Technology, Huazhong University of Science and Technology, Wuhan 430074, China. ' Faculty of Computing and Engineering, University of Ulster, Shore Road, Newtownabbey, BT37 0QB, UK

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.

Keywords: logical subnet partition; 2-level scheduling; multi-priority queues; quality of service; QoS; LSP; grid computing; grid service scheduling; bio-grid; bioinformatics.

DOI: 10.1504/IJGUC.2011.040596

International Journal of Grid and Utility Computing, 2011 Vol.2 No.2, pp.85 - 97

Accepted: 21 Dec 2009
Published online: 07 Jun 2011 *

Full-text access for editors Access for subscribers Purchase this article Comment on this article