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

Scheduling algorithm preempted based on price for hybrid reconfigurable tasks

作　　者：韩晓亚[1] 汪斌强[1] 黄万伟[1] 王保进[1] 

机构地区：[1]国家数字交换系统工程技术研究中心,郑州450002

出　　处：《计算机应用研究》2011年第11期4040-4044,共5页Application Research of Computers

基　　金：国家"863"高技术研究发展计划资助项目(2009AA01A334;2009AA012201;2008AA01A323;2008AA01A325;2008AA01A326)

摘　　要：针对同时存在独立任务和相依性任务的混合可重构任务调度,提出了基于代价抢占的混合可重构任务实时调度算法。提出了相依性任务等价运行截止时刻的计算方法,使混合可重构任务按照配置截止时刻排队配置。针对相依性任务调度特点,分析得到了相依性任务集合调度失败的充分条件,提前判定和丢弃无法调度成功的相依性任务集合;通过有限预配置防止相依性任务无效占用可重构资源;通过基于代价抢占减少调度失败任务个数。仿真结果表明,该调度算法提高了任务调度成功率。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 successfully in advance according to the sufficient condition for deciding failing schedule of dependent reconfigurable task set;the limited pre-configuration avoided the dependent tasks occuping reconfigurable resources too earlier than it could start running time;used the preempted based on price to reduce the number of scheduling failed tasks.Simulation results show that,this scheduling algorithm can increase the task scheduling success rate.

关 键 词：混合可重构任务 实时调度 有限预配置 基于代价抢占 调度成功率 

分 类 号：TP393[自动化与计算机技术—计算机应用技术] TP301.6[自动化与计算机技术—计算机科学与技术]