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

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

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

CLC Number: 

• TP301.6