A task scheduling algorithm based on Qos

摘要

The key problem of task scheduling is to give optimal matching schemes for tasks and resources. In the scheduling process, users pursue high quality and service providers favor high yields, so the high efficiency must be considered in the process of task scheduling. The author puts forward a task scheduling algorithm on the premise of fully considering the system load-balancing, improving user satisfaction. By taking the simulation experiments of Cloudsim, The author proves that the algorithm is better than the algorithm of Min-Min based on Qos and the traditional algorithm of FCFS (First Come First Service).