An Adaptive Scheduler Framework for Complex Workflow Jobs on Grid Systems

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. In this paper, 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; Make span of the job workflow and execution time of varied size jobs. The experimental results prove that proposed job scheduling and resource matching algorithms performs better when evaluated against widely used FCFS job scheduling and biggest free resource matching strategies.