UM
Fast on-line task placement and scheduling on reconfigurable devices
Zhou X.; Wang Y.; Huang X.; Peng C.
2007-12-01
Source PublicationProceedings - 2007 International Conference on Field Programmable Logic and Applications, FPL
Pages132-138
AbstractThis paper focus on on-line placement and scheduling of tasks with known executing time on reconfigurable devices. The notion of recognition-earliest for scheduling algorithms is introduced, that is the algorithm can arrange the start time of a newly arrived task as early as possible. A new scheduling algorithm is proposed. By exploit the knowledge about temporal properties of each task, the algorithm attains recognition-earliest. A fast placement algorithm is also presented. The evaluation results show that the proposed placement algorithm is one of the fastest algorithm, and the proposed scheduling algorithm achieves the best performance compared with previous algorithms, while has a quite low runtime cost. © 2007 IEEE.
DOI10.1109/FPL.2007.4380637
URLView the original
Language英語
全文获取链接
引用统计
被引频次[WOS]:6   [WOS记录]     [WOS相关记录]
Document TypeConference paper
专题University of Macau
AffiliationFudan University
推荐引用方式
GB/T 7714
Zhou X.,Wang Y.,Huang X.,et al. Fast on-line task placement and scheduling on reconfigurable devices[C],2007:132-138.
个性服务
推荐该条目
保存到收藏夹
查看访问统计
导出为Endnote文件
Google Scholar
中相似的文章 Google Scholar
[Zhou X.]的文章
[Wang Y.]的文章
[Huang X.]的文章
Baidu academic
中相似的文章 Baidu academic
[Zhou X.]的文章
[Wang Y.]的文章
[Huang X.]的文章
Bing Scholar
中相似的文章 Bing Scholar
[Zhou X.]的文章
[Wang Y.]的文章
[Huang X.]的文章
相关权益政策
暂无数据
收藏/分享
所有评论 (0)
暂无评论
 

除非特别说明,本系统中所有内容都受版权保护,并保留所有权利。