一种基于代价抢占的混合可重构任务调度算法*

针对同时存在独立任务和相依性任务的混合可重构任务调度，提出了基于代价抢占的混合可重构任务实时调度算法。提出了相依性任务等价运行截止时刻的计算方法，使混合可重构任务按照配置截止时刻排队配置。针对相依性任务调度特点，分析得到了相依性任务集合调度失败的充分条件，提前判定和丢弃无法调度成功的相依性任务集合；通过有限预配置防止相依性任务无效占用可重构资源；通过基于代价抢占减少调度失败任务个数。仿真结果表明，该调度算法提高了任务调度成功率。

Scheduling algorithm preempted based on price for hybrid reconfigurable tasks

Concerning scheduling problem of the hybrid reconfigurable tasks that including both dependent tasks and independent tasks,this paper proposed a real-time scheduling algorithm preempted based on price for hybrid reconfigurable tasks.Calculated the equal running deadline of dependent tasks to make the hybrid reconfigurable tasks be configurated according to configuration deadline.Considering the characteristic of dependent tasks,it confirmed and dropped the dependent tasks set that could't be scheduled succe...