基于G-EDF的DAG并行任务多核响应时间分析

由于未考虑DAG(directed acyclic graph)任务的自身结构， 基于G-EDF(global earliest deadline first)的DAG并行任务模型的可调度性分析存在很大的悲观性，因此本文针对DAG任务集在多处理器系统中采用G-EDF调度策略下的响应时间分析进行了研究.首先针对carry-in任务实例执行的情况提出更加精确的carry-in工作量估算方法.基于该carry-in工作量估算方法提出一种基于完成时间的问题窗口工作量估算方法.最后，结合上述两个改进策略提出了基于G-EDF的DAG任务响应时间分析方法.仿真实验表明，所提出的方法较目前已知的调度策略方法可调度性至少提高15%，最高可达25%.

Response Time Analysis of Multiprocessor Systems for DAG Parallel Tasks Based on G-EDF

Since the self-structure of the DAG(directed acyclic graph)task is not considered， the schedulability analysis of the DAG parallel task model based on G-EDF(global earliest deadline first)is very pessimistic. The response time analysis of the DAG task set under the G-EDF scheduling strategy in multiprocessor systems was studied in this paper. First， a more accurate carry-in workload estimation method was proposed for the execution of the carry-in task instance. Then a method for estimating the problem window workload of completion time was put forward based on the carry-in workload estimation method. Based on the two proposed methods， this paper proposed a response time analyzing method to derive a response time upper bound of each task. The experiments show that the proposed method outperforms the state-of-the-art method by at least 15% and at most 25%.