Research of Dependent Tasks Scheduling Algorithm in Cloud Computing Environments

Abstract

With the dependent relationship of tasks submitted by the users in the model of Cloud computing resources scheduling become stronger and stronger, it is worthy of studying how to optimize the scheduling strategy and algorithm to meet the different demands of the users, and it is absolutely importance. In this article, the author analysed the factors that will affect the entire task-sets execution firstly. Then proposed a new tasks scheduling model based on the original priority calculation method and the idea of redundant duplication of tasks. In the phase of tasks scheduling in the model, the execution results of all parent tasks of the subtask that being executing are considered. The costs of communication between task-sets has reduced by the method of redundant duplication of tasks, so that the execution time of some subtasks share be advanced, and the entire execution efficiency of task-sets can be increased. At the end of this article, from the comparative results of the space-time complexity of contrast algorithms and the algorithm proposed by the author during the process of processing dependent tasks, we can find that subtasks execution time can be advanced and the complete time of the whole task-set can be cut down to a certain extent