摘要
有效的任务调度与放置是发挥可重构计算性能优势的重要因素.针对实时任务在二维可重构器件上的在线调度问题,定义了调度算法完全识别的概念,即算法不会拒绝能够成功调度的任务.提出了新的实时在线调度与放置算法,充分利用了任务的时间信息,实现了完全识别的调度.实验表明,与已有的算法相比,新算法显著地改善了调度效果,而运行开销没有明显增加.
Efficient task scheduling and placement are very important for obtaining high performance in reconfigurable computing system. This paper focuses on the on-line scheduling of realtime tasks on a 2-dimensional reconfigurable device, and introduces the notion of recognitioncomplete for scheduling algorithms, that is the algorithm do not reject a task when a feasible schedule for this task exists. A new on-line scheduling and placement algorithm is proposed. By utilizing the temporal information of real-time tasks thoroughly, the proposed algorithm achieves recognition-complete. The simulation results show that the proposed algorithm gains a prominent improvement in scheduling performance over previous algorithms, while the run-time efficiency is preserved.
出处
《计算机学报》
EI
CSCD
北大核心
2007年第11期1901-1909,共9页
Chinese Journal of Computers
基金
国家自然科学基金(60573105)资助.~~
关键词
可重构计算
在线调度
实时
放置策略
完全识别
reconfigurable computing
on-line scheduling
real-time
placement scheme
recognition-complete
