Welcome to the InfoSci Platform
A Novel System Oriented Scheduler for Avoiding Haste Problem in Computational Grids

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

Ahmed I. Saleh
Copyright: © 2013 |Pages: 22
ISBN13: 9781466620650|ISBN10: 146662065X|EISBN13: 9781466620667
DOI: 10.4018/978-1-4666-2065-0.ch003
Cite Chapter Cite Chapter

MLA

Saleh, Ahmed I. "A Novel System Oriented Scheduler for Avoiding Haste Problem in Computational Grids." Applications and Developments in Grid, Cloud, and High Performance Computing, edited by Emmanuel Udoh, IGI Global, 2013, pp. 36-57. https://doi.org/10.4018/978-1-4666-2065-0.ch003

APA

Saleh, A. I. (2013). A Novel System Oriented Scheduler for Avoiding Haste Problem in Computational Grids. In E. Udoh (Ed.), Applications and Developments in Grid, Cloud, and High Performance Computing (pp. 36-57). IGI Global. https://doi.org/10.4018/978-1-4666-2065-0.ch003

Chicago

Saleh, Ahmed I. "A Novel System Oriented Scheduler for Avoiding Haste Problem in Computational Grids." In Applications and Developments in Grid, Cloud, and High Performance Computing, edited by Emmanuel Udoh, 36-57. Hershey, PA: IGI Global, 2013. https://doi.org/10.4018/978-1-4666-2065-0.ch003

Export Reference

Mendeley
Favorite

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.

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.