A Novel System Oriented Scheduler for Avoiding Haste Problem in Computational Grids

  • Authors:
  • Ahmed I. Saleh

  • Affiliations:
  • Mansoura University, Egypt

  • Venue:
  • International Journal of Grid and High Performance Computing
  • Year:
  • 2011

Quantified Score

Hi-index 0.00

Visualization

Abstract

Scheduling is an important issue that must be handled carefully to realize the "Just login to compute" principle introduced by computational grids. Current grid schedulers suffer from the haste problem, which is the inability to schedule all tasks successfully. Accordingly, some tasks fail to complete execution as they are allocated to unsuitable workers. Others may not start execution as suitable workers are previously allocated to other tasks. This paper introduces the scheduling haste problem and presents a novel high throughput grid scheduler. The proposed scheduler selects the most suitable worker to execute an input grid task. Hence, it minimizes the turnaround time for a set of grid tasks. Moreover, the scheduler is system oriented and avoids the scheduling haste problem. Experimental results show that the proposed scheduler outperforms traditional grid schedulers as it introduces better scheduling efficiency.