Fragmentation Aware Placement in Reconfigurable Devices

Ahmed Abou ElFarag, H. M. El-Boghdadi, S. Shaheen
{"title":"Fragmentation Aware Placement in Reconfigurable Devices","authors":"Ahmed Abou ElFarag, H. M. El-Boghdadi, S. Shaheen","doi":"10.1109/IWSOC.2006.348261","DOIUrl":null,"url":null,"abstract":"Partially reconfigurable field-programmable gate arrays (FPGAs) allow parts of the chip to be configured at runtime where each part could hold an independent task. Online placements of these tasks result in area fragmentation leading to a poor utilization of chip resources. In this paper, we propose a new metric for measuring area fragmentation. The new fragmentation metric gives an indication to the continuity of the occupied (or free) space and not the amount of occupied space. We show how this metric can be extended for multidimensional structures. We also show how this metric can be computed efficiently at run time. Next we use this measure during online placement of tasks on FPGAs, such that the chip fragmentation is reduced. Our results show improvement of chip utilization when using this fragmentation aware placement method over other placement methods with well known bottom left first fit, and best fit placement strategies","PeriodicalId":134742,"journal":{"name":"2006 6th International Workshop on System on Chip for Real Time Applications","volume":"19 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2006-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2006 6th International Workshop on System on Chip for Real Time Applications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IWSOC.2006.348261","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 4

Abstract

Partially reconfigurable field-programmable gate arrays (FPGAs) allow parts of the chip to be configured at runtime where each part could hold an independent task. Online placements of these tasks result in area fragmentation leading to a poor utilization of chip resources. In this paper, we propose a new metric for measuring area fragmentation. The new fragmentation metric gives an indication to the continuity of the occupied (or free) space and not the amount of occupied space. We show how this metric can be extended for multidimensional structures. We also show how this metric can be computed efficiently at run time. Next we use this measure during online placement of tasks on FPGAs, such that the chip fragmentation is reduced. Our results show improvement of chip utilization when using this fragmentation aware placement method over other placement methods with well known bottom left first fit, and best fit placement strategies
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
可重构设备中碎片感知放置
部分可重构的现场可编程门阵列(fpga)允许在运行时配置芯片的各个部分,其中每个部分可以执行独立的任务。这些任务的在线放置会导致区域碎片化,从而导致芯片资源的利用率低下。本文提出了一种新的面积破碎度度量方法。新的碎片度量给出了占用(或空闲)空间的连续性,而不是占用空间的数量。我们将展示如何将该度量扩展到多维结构。我们还将展示如何在运行时有效地计算此度量。接下来,我们在fpga上的任务在线放置期间使用此措施,从而减少了芯片碎片。我们的研究结果表明,当使用这种碎片感知放置方法时,芯片利用率比其他已知的左下角第一拟合和最佳拟合放置策略的放置方法有所提高
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
FPGA-Based Low-level CAN Protocol Testing A generic method for fault injection in circuits SoC Design Quality, Cycletime, and Yield Improvement Through DfM A Benchmark Approach for Compilers in Reconfigurable Hardware Fragmentation Aware Placement in Reconfigurable Devices
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1