| 可重配置实时任务的快速动态调度算法 |
| |
| 引用本文： | 周博,邱卫东,陈伟男,彭澄廉.可重配置实时任务的快速动态调度算法[J].计算机辅助设计与图形学学报,2006,18(4):525-531. |
| |
| 作者姓名： | 周博 邱卫东 陈伟男 彭澄廉 |
| |
| 作者单位： | 复旦大学计算机与信息技术系,上海,200433 |
| |
| 摘 要： | 要提出一种快速动态定位和实时任务调度算法，采用最早最迟开始时间优先、最优化空白区域管理和配置重用的调度原则，能够反映实时任务的紧迫度，快速地调度实时可配置硬件任务，同时有效地管理可重构资源．实验结果表明，该算法可以有效地提高系统的总体性能．
|
| 关 键 词： | 部分可重配置器件 最优化空白区域 最早最迟开始时间优先 配置重用 |
| 收稿时间： | 2005-01-07 |
| 修稿时间： | 2005-07-08 |
Fast On-Line Scheduling for Reconfigurable Real-Time Tasks |
| |
| Zhou Bo,Qiu Weidong,Chen Weinan,Peng Chenglian.Fast On-Line Scheduling for Reconfigurable Real-Time Tasks[J].Journal of Computer-Aided Design & Computer Graphics,2006,18(4):525-531. |
| |
| Authors: | Zhou Bo Qiu Weidong Chen Weinan Peng Chenglian |
| |
| Affiliation: | Department of Computer and Information Technology, Fudan University, Shanghai 200433 |
| |
| Abstract: | An on-line scheduling for reconfigurable real-time tasks, called fast on-line real-time scheduling (FORS), is proposed. The algorithm adopts the scheduling principle of earliest latest starting time first, which will reflect different emergency levels of real-time tasks. The algorithm constructs a fast and correct empty resource management and is based on reconfiguration reuse. Experimental results show that the developed scheduler can lead to great performance gains. |
| |
| Keywords: | partially reconfigurable device optimal empty region earliest lastest starting time first reconfiguration reuse |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
