Journal of Computer Applications ›› 2014, Vol. 34 ›› Issue (2): 387-390.

• Advanced computing • Previous Articles     Next Articles

Reconfigurable hybrid task scheduling algorithm

SHEN Dhu,ZHU Zhiyu,WU Jiang   

  1. School of Electronic Information, Jiangsu University of Science and Technology, Zhenjiang Jiangsu 212003, China
  • Received:2013-07-10 Revised:2013-09-09 Online:2014-02-01 Published:2014-03-01
  • Contact: ZHU Zhiyu
  • Supported by:
    National Natural Science Foundation

可重构混合任务调度算法

沈舒,朱志宇,吴将   

  1. 江苏科技大学 电子信息学院,江苏 镇江 212003
  • 通讯作者: 朱志宇
  • 作者简介:沈舒(1989-),女,江苏镇江人,硕士研究生,主要研究方向:可重构计算、系统仿真;朱志宇(1971-),男,江苏扬州人,教授,博士,主要研究方向:智能计算、非线性系统滤波;吴将(1988-),男,安徽安庆人,硕士研究生,主要研究方向:系统仿真、粒子滤波、目标跟踪。
  • 基金资助:
    国家自然科学基金资助项目;江苏省“六大人才高峰”高层次人才项目

Abstract: An important component of reconfigurable task scheduling is how to hide and reduce the configuration time. A reconfigurable hybrid task scheduling algorithm was proposed at solving the problem that the hybrid task was relevant for software and hardware simultaneously. The task and its chronological order should be figured out first by means of pre-configuration and priority algorithm and the successive task should be hidden into the run-time for predecessor task afterwards. In the meantime, the strategy of configuration reuse can be adopted in order to reduce the quantity of configuration for same tasks. Compared to the existing algorithms, the new algorithm is much more effective and its cost is less.

Key words: reconfigurable system, task scheduling, pre-configuration, reuse, Directed Acyclic Graph (DAG)

摘要: 隐藏和减少配置时间是可重构任务调度的关键问题。针对同时存在相关联的软、硬件任务的可重构混合任务,提出一种可重构混合任务调度算法。通过预配置策略和优先级算法确定需要预先配置的任务及其预配置顺序,将后继任务的配置过程隐藏在前驱任务的运行时间中,并采用配置重用策略,减少相同任务的配置次数。实验仿真结果表明,同已有的算法相比,该调度算法调度效果明显,减少了可重构任务调度的整体开销。

关键词: 可重构系统, 任务调度, 预先配置, 重用, 有向无环图

CLC Number: