二维部分运行时可重构fpga上实时任务的在线布置

Qingxu Deng, Fanxin Kong, Nan Guan, Mingsong Lv, W. Yi
{"title":"二维部分运行时可重构fpga上实时任务的在线布置","authors":"Qingxu Deng, Fanxin Kong, Nan Guan, Mingsong Lv, W. Yi","doi":"10.1109/SEC.2008.55","DOIUrl":null,"url":null,"abstract":"Partially Runtime-Reconfigurable (PRTR) FPGAs allow hardware tasks to be placed and removed dynamically at runtime in multi-tasking systems. Such systems need to not only support sharing of the resources in space, but also guarantee timely execution of the tasks. We present a novel online task placement algorithm under real-time constraints. The proposed algorithm uses a new metric to allocate tasks that makes tasks be placed densely, thereby, larger continuous free area remains. Simulation experiments indicate that our approach gives better results and sometimes has lower algorithm complexity than existingtechniques.","PeriodicalId":231129,"journal":{"name":"2008 Fifth IEEE International Symposium on Embedded Computing","volume":"61 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2008-10-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"6","resultStr":"{\"title\":\"On-Line Placement of Real-Time Tasks on 2D Partially Run-Time Reconfigurable FPGAs\",\"authors\":\"Qingxu Deng, Fanxin Kong, Nan Guan, Mingsong Lv, W. Yi\",\"doi\":\"10.1109/SEC.2008.55\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Partially Runtime-Reconfigurable (PRTR) FPGAs allow hardware tasks to be placed and removed dynamically at runtime in multi-tasking systems. Such systems need to not only support sharing of the resources in space, but also guarantee timely execution of the tasks. We present a novel online task placement algorithm under real-time constraints. The proposed algorithm uses a new metric to allocate tasks that makes tasks be placed densely, thereby, larger continuous free area remains. Simulation experiments indicate that our approach gives better results and sometimes has lower algorithm complexity than existingtechniques.\",\"PeriodicalId\":231129,\"journal\":{\"name\":\"2008 Fifth IEEE International Symposium on Embedded Computing\",\"volume\":\"61 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2008-10-06\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"6\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2008 Fifth IEEE International Symposium on Embedded Computing\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/SEC.2008.55\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2008 Fifth IEEE International Symposium on Embedded Computing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SEC.2008.55","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 6

摘要

部分运行时可重构(PRTR) fpga允许在多任务系统的运行时动态地放置和移除硬件任务。这样的系统不仅需要支持空间资源的共享,还需要保证任务的及时执行。提出了一种实时约束下的在线任务分配算法。该算法采用一种新的指标来分配任务,使任务分布更加密集,从而保持更大的连续自由面积。仿真实验表明,我们的方法得到了更好的结果,有时比现有的技术具有更低的算法复杂度。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
On-Line Placement of Real-Time Tasks on 2D Partially Run-Time Reconfigurable FPGAs
Partially Runtime-Reconfigurable (PRTR) FPGAs allow hardware tasks to be placed and removed dynamically at runtime in multi-tasking systems. Such systems need to not only support sharing of the resources in space, but also guarantee timely execution of the tasks. We present a novel online task placement algorithm under real-time constraints. The proposed algorithm uses a new metric to allocate tasks that makes tasks be placed densely, thereby, larger continuous free area remains. Simulation experiments indicate that our approach gives better results and sometimes has lower algorithm complexity than existingtechniques.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信