The Open Cybernetics & Systemics Journal

2014, 8 : 111-114
Published online 2014 December 30. DOI: 10.2174/1874110X01408010111
Publisher ID: TOCSJ-8-111

Task Scheduling Algorithm based on Greedy Strategy in Cloud Computing

Zhou Zhou and Hu Zhigang
School of Software, Central South University, Changsha, 410004, P.R. China.

ABSTRACT

In view of Min-Min algorithm prefers scheduling small tasks and Max-Min algorithm prefers scheduling big tasks led to the problem of load imbalance in cloud computing, a new algorithm named Min-Max is proposed. Min-Max makes good use of time of greedy strategy, small tasks and big tasks are put together for scheduling in order to solve the problem of load imbalance. Experimental results show that the Min-Max improves the utilization rate of the entire system and saves 9% of the overall execution time compared with Min-Min. As compared to Max-Min, Min-Max improves the utilization rate of the entire system and the total completion time and average response time are saved by 7% and 9%, respectively.

Keywords:

Cloud computing, greedy strategy, load balancing, Min-Min, Max-Min.