Home > Papers

 
 
Task scheduling algorithm based on greedy strategy in cloud computing
ZHOU Zhou #,HU Zhigang *
School of Software, Central South University, Changsha 410004
*Correspondence author
#Submitted by
Subject:
Funding: This work was supported by a Grant from the National Natural Science Foundation （No.No. 61272148) and the Ph.D. Programs Foundation）
Opened online:25 March 2014
Accepted by: none
Citation: ZHOU Zhou,HU Zhigang.Task scheduling algorithm based on greedy strategy in cloud computing[OL]. [25 March 2014] http://en.paper.edu.cn/en_releasepaper/content/4590564
 
 
In view of Min-Min algorithm prefers scheduling small tasks and Max-Min algorithm prefers scheduling big tasks led to problem of load imbalance in cloud computing, a new algorithm named Min-Max is proposed. Min-Max makes good use of time for 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 entire system and saves 9% overall execution time compared with Min-Min. As compared with Max-Min, Min-Max improves the utilization rate of entire system, the total completion time and average response time are saved 7% and 9% respectively.
Keywords:cloud computing; greedy strategy; load balancing; Min-Min; Max-Min
 
 
 

For this paper
  • ● PDF (0B)
  • ● Revision 0 　　
  • ● Print this paper
  • ● Recommend this paper to a friend
  • ● Add to my favorite list

    Saved Papers

    Please enter a name for this paper to be shown in your personalized Saved Papers list

Tags
Add yours

Related Papers

Statistics
PDF Downloaded 273
Bookmarked 0
Recommend 5
Comments Array
Submit your papers