Ahmed I. Saleh
Computational grids, scheduling, haste problem, system-orientedschedulers
Recently, grid computing is growing in popularity and importance as it introduces a novel “Just login to compute paradigm. Current grid schedulers suffer from the haste problem, which is the inability to successfully schedule all incoming tasks. Accordingly, some tasks may fail to complete execution as they are allocated to unsuitable workers. Others may not start execution as the suitable workers had been allocated to other tasks. This paper is the first to introduce the scheduling haste problem. It also presents a novel high throughput grid scheduler. The proposed scheduler can select the most suitable worker to execute an input grid task. Hence, it guarantees the minimal turnaround time for a set of grid tasks. Moreover, our scheduler is a system-oriented one as it avoids the scheduling haste problem. Experimental results have shown that the proposed scheduler outperforms traditional grid schedulers as it introduces a better scheduling efficiency.
Important Links:
Go Back
