一种改进的实时任务调度算法

摘要

Aiming at the singleness of priority selection,the important task is delayed for random scheduling when tasks’pri-orities are same,a double priority scheduling algorithm (DPSA)is designed.The scheduling order of task is based on length of the task’s path to the entrance task of resource and the upward weights in IHEFT.The proposed algorithm is compared with HEFT algorithm through the generated random DAG.The experimental result shows that DPSA can reduce the sched-uling length.%针对现有的表调度算法优先级选取单一、优先级相同时任务随机调度导致某些重要任务延迟处理的问题,提出了一种双优先级任务调度算法(DPSA)。DPSA根据任务到入口任务的路径长度和 IHEFT算法上行权重作为任务优先级安排任务调度顺序。采用随机生成的有向无环图(DAG),与 HEFT算法进行对比实验,实验结果表明,DPSA 能获得更短的调度长度。