An Adaptive Scheduler Framework for Complex Workflow Jobs on Grid Systems

  • Authors:
  • G. M. Siddesh;K. G. Srinisas

  • Affiliations:
  • Jawaharlal Nehru Technological University, Hyderabad, India;Department of Computer Science & Engineering, M S Ramaiah Institute of Technology, Bangalore, India

  • Venue:
  • International Journal of Distributed Systems and Technologies
  • Year:
  • 2012

Quantified Score

Hi-index 0.00

Visualization

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.