The IRMA Community
Newsletters
Research IRM
Click a keyword to search titles using our InfoSci-OnDemand powered search:
|
A Novel System Oriented Scheduler for Avoiding Haste Problem in Computational Grids
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.
Related Content
Radhika Kavuri, Satya kiranmai Tadepalli.
© 2024.
19 pages.
|
Ramu Kuchipudi, Ramesh Babu Palamakula, T. Satyanarayana Murthy.
© 2024.
10 pages.
|
Nidhi Niraj Worah, Megharani Patil.
© 2024.
21 pages.
|
Vishal Goar, Nagendra Singh Yadav.
© 2024.
23 pages.
|
S. Boopathi.
© 2024.
24 pages.
|
Sai Samin Varma Pusapati.
© 2024.
25 pages.
|
Swapna Mudrakola, Krishna Keerthi Chennam, Shitharth Selvarajan.
© 2024.
11 pages.
|
|
|