Task Scheduling Algorithm based on Greedy Strategy in Cloud Computing

@inproceedings{Zhou2015TaskSA,
  title={Task Scheduling Algorithm based on Greedy Strategy in Cloud Computing},
  author={Zhou Zhou and Hu Zhigang},
  year={2015}
}
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… CONTINUE READING