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

摘要

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)工作流的调度问题,提出一种基于最小化数据传输时间和任务完成时间(LTCT)的算法,用于处理具有相同优先级的多个DAG工作流之间的调度问题.在多个DAG优先级各不相同时的情况下,给出多优先级多DAG的混合调度算法.实验结果表明,LTCT算法较E-Fairness算法在保证多DAG调度公平性的基础上,能避免额外的数据传输开销,有利于缩短整个工作流的执行Makespan,提高资源的利用率.