采用配置完成优先策略的可重构任务调度算法  

Scheduling Algorithm for Dependent Reconfigurable Tasks Based on Configuration Completion First

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

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

出　　处：《小型微型计算机系统》2012年第3期587-593,共7页Journal of Chinese Computer Systems

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

摘　　要：如何隐藏和减少配置时间是相依性可重构任务调度的关键问题.提出一种采用配置完成优先策略的相依性可重构任务调度算法,通过基于预配置优先级的列表调度算法,实现将后续任务的配置时间隐藏于前驱任务的运行时间中,并采用基于配置完成优先策略的配置重用机制,减少了任务调度后的配置过程,从而在总体上缩短了相依性任务集合的运行时间.仿真结果表明,该调度算法能有效避免调度死锁,并可减少相依性可重构任务的整体运行时间.How to hide and reduce the configuration overhead of reconfigurable tasks is the key to dependent reconfigurable tasks scheduling problem.This paper presents a scheduling algorithm for dependent reconfigurable tasks which is based on configuration completion first,list scheduling based on pre-configuration priority was used to hide predecessor task′s configuration time in the successor task′s execution time,the configuration reuse mechanism based on configuration completion first was used to reduce the configuration process of the task.This algorithm can reduce the runtime of the whole tasks set.Experiment results show that,this algorithm can avoid scheduling deadlock and effectively reduce scheduling runtime of the whole tasks set.

关 键 词：相依性可重构任务 预配置 列表调度 配置重用 配置完成优先 

分 类 号：TP393[自动化与计算机技术—计算机应用技术]