Welcome to the InfoSci Platform
Reference Hub1
An Adaptive Scheduler Framework for Complex Workflow Jobs on Grid Systems

An Adaptive Scheduler Framework for Complex Workflow Jobs on Grid Systems

G. M. Siddesh, K. G. Srinisas
Copyright: © 2012 |Volume: 3 |Issue: 4 |Pages: 17
ISSN: 1947-3532|EISSN: 1947-3540|EISBN13: 9781466611788|DOI: 10.4018/jdst.2012100106
Cite Article Cite Article

MLA

Siddesh, G. M., and K. G. Srinisas. "An Adaptive Scheduler Framework for Complex Workflow Jobs on Grid Systems." IJDST vol.3, no.4 2012: pp.63-79. http://doi.org/10.4018/jdst.2012100106

APA

Siddesh, G. & Srinisas, K. (2012). An Adaptive Scheduler Framework for Complex Workflow Jobs on Grid Systems. International Journal of Distributed Systems and Technologies (IJDST), 3(4), 63-79. http://doi.org/10.4018/jdst.2012100106

Chicago

Siddesh, G. M., and K. G. Srinisas. "An Adaptive Scheduler Framework for Complex Workflow Jobs on Grid Systems," International Journal of Distributed Systems and Technologies (IJDST) 3, no.4: 63-79. http://doi.org/10.4018/jdst.2012100106

Export Reference

Mendeley
Favorite Full-Issue Download

Abstract

Grid Computing provides sharing of geographically distributed resources among large scale complex applications. Due to dynamic nature of resources in grid, there is a need of highly efficient job scheduling and resource management policies in grid. A novel Grid Resource Scheduler (GRS) is proposed to effectively utilize the available resources in Grid. Proposed GRS contributes, an optimal job scheduling algorithm on Job Rank-Backfilling policy and a resource matching algorithm based on ranking of resources with best fit allocation model. Performance of GRS is measured by considering a web based BLAST algorithm – a bioinformatics application. GRS aims in reducing; Makespan of the job workflow, execution time of varied size jobs, response time of the submitted jobs and overhead of using the system. It also considers improving the utilization factor and throughput of the available heterogeneous resources in grid. The experimental results prove that proposed grid scheduler framework performs better when evaluated against widely used First Come First Serve (FCFS), Shortest Job First (SJF) and Minimum Time to Due Date (MTTD) scheduling strategies.

Request Access

You do not own this content. Please login to recommend this title to your institution's librarian or purchase it from the IGI Global bookstore.