Associate task scheduling algorithm based on delay-bound constraint in cloud computing

作者：Mao Yingchi; Zhu Lili; Chen Xi; Jie Qing

来源：13th International Symposium on Distributed Computing and Applications to Business, Engineering and Science, DCABES 2014, 2014-11-24 To 2014-11-27.

DOI：10.1109/DCABES.2014.22

• Better performance
• Cloud computing environments
• Delay bound
• Directed acyclic graph (DAG)
• Hierarchical task model
• Resource utilizations
• Task-scheduling
• Task-scheduling algorithms

Task scheduling is one of the most important issues in the cloud computing environments. In the cloud systems, the main goal of the task scheduling algorithms is to balance the workload among the computing nodes and maximize the utilization while meeting the bound of the total execution time. Concerning the delay of the associated tasks scheduling in cloud computing, a hierarchical task model was discussed and the associated task scheduling algorithm based on delay-bound constraint (ATS-DB) was proposed. The associated tasks and the task execution order were represented by one directed acyclic graph (DAG). The proposed hierarchical task model can improve the task execution concurrency. The independent tasks in each layer was grouped into the corresponding task set belonging to the task layer. Through the calculation of the total tasks execution time bound in each task layer, the associated task was dispatched to the resources with the minimum execution time. Extensive experimental results demonstrated that the proposed ATS-DB algorithm can achieve better performance than HEFT algorithm in the terms of the total execution time and resource utilization.

• 出版日期2014
• 单位河海大学