文章基本信息

标题：Delay-Bounded Associated Tasks Scheduling Based on Hierarchical Graph Model in the Cloud
本地全文：下载
作者：Yingchi Mao ; Haishing Zhong ; Longbao Wang 等
期刊名称：International Journal of Hybrid Information Technology
印刷版ISSN：1738-9968
出版年度：2016
卷号：9
期号：12
页码：367-386
出版社：SERSC
摘要：Cloud computing can provide the dynamic and elastic virtual resources for the users to execute the large-scale computing tasks. It has become the hot spot in the academic and industry fields. Task scheduling is one of the most important issues in the Cloud. In the Cloud systems, the goal of the tasks scheduling is to spread the workload among the computing nodes and maximize the utilization while the total execution time is within the specific delay bound. At present, almost scheduling algorithms focus on the single task dispatch in the Cloud. Unfortunately, there is little research on the associate tasks scheduling considering the deadline bound. In this paper, two hierarchical task models were discussed and the corresponding associated task scheduling algorithms based on delay-bound constraint (ATS-DB and SAH-DB) were proposed. The associated tasks and the task execution order were represented by one directed acyclic graph (DAG). The proposed hierarchical task models can improve the task execution concurrency. Extensive experimental results demonstrated that the proposed scheduling algorithms, ATS-DB and SAH-DB, can reduce the execution cost and improve the resource utilization within the user-expected delay bound.
关键词：Cloud computing; delay bound; associated task scheduling; hierarchical ;graph model