摘要
为了最小化云计算系统的任务调度长度,结合表启发式调度技术和任务复制的思想提出基于路径优先权的任务调度算法。采用一种新方法计算DAG图中任务节点及边的权值,从最高优先权的路径开始依次选择任务进行调度,并通过有选择性地复制任务节点的父任务来减少任务间信息传送的时间花费,最后将任务安排到使其执行完成时间最早的虚拟机上。通过随机产生的DAG图与HEFT算法进行对比分析,实验结果表明了该算法能获得较短的调度长度。
Abstraet：To minimize the task scheduling length in the cloud computing system,a task scheduling algorithm is proposed by combining list heuristic scheduling and task duplication.The task nodes and edges＇ weight of the DAG are computed by a new approach.The task is successively selected to schedule from higher priority path and the parent tasks are duplicated to reduce the communication cost of inter-virtual machines.Finally the task is scheduled on the virtual machine that can complete its execution at the earliest time.The algorithm proposed is compared with HEFT algorithm through generated random graphs.The experimental results show that this algorithm can reduce the scheduling length effectively.
出处
《计算机工程与设计》
CSCD
北大核心
2013年第10期3511-3515,共5页
Computer Engineering and Design
基金
重庆邮电大学自然科学基金项目(A2011-25)
关键词
云计算
异构系统
表启发式调度
有向无环图
路径优先级
任务复制
cloud computing
heterogeneous systems
list heuristic scheduling algorithm
directed acyclic graph （DAG）
path priority-based
task duplication
