基于最小化传输和完成时间的多DAG调度  

Multiple DAG Scheduling Based on Lowest Transportation and Completion Time

作　　者：任丰玲[1] 于炯[1,2] 杨兴耀[1] 

机构地区：[1]新疆大学信息科学与工程学院,乌鲁木齐830046 [2]北京理工大学计算机学院,北京100081

出　　处：《计算机工程》2012年第23期287-290,共4页Computer Engineering

基　　金：国家自然科学基金资助项目(60863003;61063042);新疆维吾尔自治区自然科学基金资助项目(2011211A011)

摘　　要：针对云计算环境下多个有向无环图(DAG)工作流的调度问题,提出一种基于最小化数据传输时间和任务完成时间(LTCT)的算法,用于处理具有相同优先级的多个DAG工作流之间的调度问题。在多个DAG优先级各不相同时的情况下,给出多优先级多DAG的混合调度算法。实验结果表明,LTCT算法较E-Fairness算法在保证多DAG调度公平性的基础上,能避免额外的数据传输开销,有利于缩短整个工作流的执行Makespan,提高资源的利用率。According to multiple DAG workflow scheduling problem in heterogeneous distributed environments, a scheduling algorithm is proposed based on minimizing .the data transmission time and task completion time, which can deal with the problem that multiple DAG workflows have the same priority, and gives the multi-priority multi-DAG mixed scheduling algorithm. Compared with E-Fairness algorithm, experimental results show that on the basis of fairness to ensure multiple DAG scheduling, this algorithm can avoid additional data transfer overhead, shorten the entire workflow execution Makespan, and improve resource utilization.

关 键 词：多DAG调度 多优先级 任务权值 公平性 时间跨度 时隙 

分 类 号：TP393[自动化与计算机技术—计算机应用技术]