ENHANCED MIN-MIN TASK SCHEDULING ALGORITHM BASED ON LOAD BALANCING IN GRID COMPUTING | ||
| International Journal of Intelligent Computing and Information Sciences | ||
| Article 2, Volume 15, Issue 2, April 2015, Pages 15-30 | ||
| Document Type: Original Article | ||
| DOI: 10.21608/ijicis.2015.10914 | ||
| Authors | ||
| J Daood1; S Abuelenin2; S Elmougy1 | ||
| 1Departmant. of computer science, Faculty of Computers and Information, Mansoura University, Egypt | ||
| 2Faculty of Computer and Information,Mansoura University, Egypt | ||
| Abstract | ||
| : Grid task scheduling is one of the most important parts in Grid resource management system. In this paper, a new task scheduling algorithm is proposed and implemented based on Min-Min algorithm with taking into consideration load balancing. This proposed algorithm works by executing the small tasks by slower resources while executing the relatively large tasks by faster resources under the decided makespan. Makespan and CPU utilization are the two metrics used to evaluate the performance of the proposed algorithm rather than improvement ratio and usages rate of resource. The proposed algorithm consumes the same running time of original Min-Min algorithm even it uses a new derived Expected Sum Completed Time (ESCT) metric rather than using the standard Expected Completion Time (ECT) and Expected Execution Time(EET). Experimentations results show that the proposed algorithm produces relevant equivalent heavy resources as the guaranteed load balance schedule and makespan is reduced. | ||
|
Statistics Article View: 249 |
||
