基于图结构的DAG任务可调度性分析

SCHEDULABILITY ANALYSIS OF DAG TASKS BASED ON GRAPH STRUCTURE

对全局EDF(Earliest Deadline First)调度策略下DAG(Directed Acyclic Graph)任务的可调度性进行研究。通过修正任务节点的执行窗口,考虑任务的DAG结构特征,提出一种对任务间干扰和任务内干扰具有更高计算精度的可调度性测试算法。在保证算法具有较高识别率的同时,使可调度性测试结果更加符合实际情况。实验结果表明该方法是行之有效的。

This paper studies the schedulability of DAG tasks under global EDF scheduling strategy.By modifying the execution window of task nodes and considering the DAG structure characteristics of tasks,we proposed a schedulability test algorithm with higher computational accuracy for inter-task interference and intra-task interference.While ensuring the high recognition rate of the algorithm,the schedulability test results were more in line with the actual situation.The experimental results show that the proposed method is effective.