可重构计算系统中的依赖感知放置

Foad Lotfifar, H. Shahhoseini, Himan Khanzadi
{"title":"可重构计算系统中的依赖感知放置","authors":"Foad Lotfifar, H. Shahhoseini, Himan Khanzadi","doi":"10.1109/ISMS.2011.82","DOIUrl":null,"url":null,"abstract":"Taking into account inter-task dependency in reconfigurable computing systems, a step closer to reality, can interfere with placement algorithm and it highly affects on hardware resource utilization. In this paper a tree based placement algorithm is proposed that its specifications are efficiency and low execution time. The main feature of this placement algorithm is that it is easy and simple to implement. Furthermore, the effects of inter-task dependency on speed and hardware resource utilization are investigated, which are important in pursuing appropriate policies for task placement based on various workload characterization. Finally, based on simulation results, we show that which strategy (considering dependency or not) is better in different system conditions.","PeriodicalId":193599,"journal":{"name":"2011 Second International Conference on Intelligent Systems, Modelling and Simulation","volume":"50 1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2011-01-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Dependency Aware Placement in Reconfigurable Computing Systems\",\"authors\":\"Foad Lotfifar, H. Shahhoseini, Himan Khanzadi\",\"doi\":\"10.1109/ISMS.2011.82\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Taking into account inter-task dependency in reconfigurable computing systems, a step closer to reality, can interfere with placement algorithm and it highly affects on hardware resource utilization. In this paper a tree based placement algorithm is proposed that its specifications are efficiency and low execution time. The main feature of this placement algorithm is that it is easy and simple to implement. Furthermore, the effects of inter-task dependency on speed and hardware resource utilization are investigated, which are important in pursuing appropriate policies for task placement based on various workload characterization. Finally, based on simulation results, we show that which strategy (considering dependency or not) is better in different system conditions.\",\"PeriodicalId\":193599,\"journal\":{\"name\":\"2011 Second International Conference on Intelligent Systems, Modelling and Simulation\",\"volume\":\"50 1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2011-01-25\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2011 Second International Conference on Intelligent Systems, Modelling and Simulation\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISMS.2011.82\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2011 Second International Conference on Intelligent Systems, Modelling and Simulation","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISMS.2011.82","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

摘要

在可重构计算系统中,考虑任务间的依赖关系是一种更接近现实的方法,它会干扰布局算法,并严重影响硬件资源的利用率。本文提出了一种基于树的布局算法,其特点是效率高、执行时间短。这种布局算法的主要特点是易于实现。此外,还研究了任务间依赖性对速度和硬件资源利用率的影响,这对于根据各种工作负载特征追求适当的任务放置策略非常重要。最后,基于仿真结果,我们展示了在不同的系统条件下哪种策略(考虑依赖性或不考虑依赖性)更好。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Dependency Aware Placement in Reconfigurable Computing Systems
Taking into account inter-task dependency in reconfigurable computing systems, a step closer to reality, can interfere with placement algorithm and it highly affects on hardware resource utilization. In this paper a tree based placement algorithm is proposed that its specifications are efficiency and low execution time. The main feature of this placement algorithm is that it is easy and simple to implement. Furthermore, the effects of inter-task dependency on speed and hardware resource utilization are investigated, which are important in pursuing appropriate policies for task placement based on various workload characterization. Finally, based on simulation results, we show that which strategy (considering dependency or not) is better in different system conditions.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术文献互助群
群 号:604180095
Book学术官方微信