基于挂靠合成标定优先级方法的动态多DAG调度
n Improved Algorithm for Dynamic Multi-DAG Schedule
随着动态多DAG工作流调度算法的应用越来越重要，很多关于单DAG以及多DAG的调度算法被提出。其中动态多DAG调度算法由于每个到来的DAG时间不同，规模不一，调度起来也最为复杂。本文基于Planner-guided算法的框架下，提出了新的优先级标定方法与算法框架流程的改进。在新的DAG中找到向上权值与剩余DAG最大向下权值差距最小的节点，将旧的合成DAG的尾节点挂靠在此节点上，从而合成新的DAG进行总的优先级计算。相比于Planner-guided算法，本算法可以得到更小的平均makespan值并且提高了资源利用率。
In this paper, we researched the dynamic multi-DAG schedule problem and proposed an improved algorithm based on the planner-guided algorithm. The key point to the problem is the strategy to calculate the priorities of the tasks. When a new DAG arrives, we attach the remnant tasks onto the new coming DAG by using the maximum EFT value of the remnant tasks and the EST values of the new tasks. In addition, we also proposed an improved algorithm framework based on the planner-guided algorithm. Compared with the planner-guided algorithm, we can get lower makespans and higher utilization ratios of the resources.
周勇、赵新政、张明会
计算技术、计算机技术
计算机软件与理论多DAG调度makespan
computer software and theorymulti-DAGSchedulemakespan
周勇,赵新政,张明会.基于挂靠合成标定优先级方法的动态多DAG调度[EB/OL].(2015-03-17)[2025-07-17].http://www.paper.edu.cn/releasepaper/content/201503-149.点此复制
评论