作者投稿和查稿 主编审稿 专家审稿 编委审稿 远程编辑

计算机工程 ›› 2011, Vol. 37 ›› Issue (6): 239-241. doi: 10.3969/j.issn.1000-3428.2011.06.083

• 工程应用技术与实现 • 上一篇    下一篇

基于可重构系统的亚可抢占任务调度算法

许新达,徐 成,刘 彦,李仁发   

  1. (湖南大学计算机与通信学院,长沙 410082)
  • 出版日期:2011-03-20 发布日期:2011-03-29
  • 作者简介:许新达(1982-),男,硕士研究生,主研方向:嵌入式系统结构,可重构计算;徐 成,教授;刘 彦,博士;李仁发,教授
  • 基金资助:
    国家“863”计划基金资助项目(2007AA01Z104);国家自然科学基金资助项目(60973030)

Secondary Preemptable Task Scheduling Algorithm Based on Reconfigurable System

XU Xin-da, XU Cheng, LIU Yan, LI Ren-fa   

  1. (School of Computer and Communication, Hunan University, Changsha 410082, China)
  • Online:2011-03-20 Published:2011-03-29

摘要: 针对目前在线调度算法忽略预留任务特殊性的问题,基于现有的放置策略,定义并证明一个可靠的基于最大邻接边数的放置策略。提出一种基于亚可抢占性的任务调度算法,即剥夺预留任务所占用的可重构资源再进行统一离线调度。实验表明,与已有算法相比,该算法具有更高的任务接受率和芯片利用率,且并未明显增加运行时的开销。

关键词: 可重构计算, 在线调度, 亚可抢占, 代价函数, 动态可重构系统

Abstract: This paper focuses on the online scheduling problem of real-time task based on two-dimension dynamic reconfiguration system, presents a placement strategy based on maximal adjacent edges, and proposes a Secondary Preemptable Scheduling Algorithm(SPSA) for hardware tasks, i.e., deprive the reconfigurable resource of the reserved task, then performing unified off-line scheduling. Experiment shows the proposed algorithm has a higher task acceptance rate and a more effective chip utilization, without markedly runtime overhead increased.

Key words: reconfigurable computing, online scheduling, secondary preemptable, cost function, dynamic reconfigurable system

中图分类号: