Library-Based Placement and Routing in FPGAs with Support of Partial Reconfiguration

Fubing Mao, Yi-Chung Chen, Wei Zhang, Hai Helen Li, Bingsheng He
{"title":"Library-Based Placement and Routing in FPGAs with Support of Partial Reconfiguration","authors":"Fubing Mao, Yi-Chung Chen, Wei Zhang, Hai Helen Li, Bingsheng He","doi":"10.1145/2901295","DOIUrl":null,"url":null,"abstract":"While traditional Field-Programmable Gate Array design flow usually employs fine-grained tile-based placement, modular placement is increasingly required to speed up the large-scale placement and save the synthesis time. Moreover, the commonly used modules can be pre-synthesized and stored in the library for design reuse to significantly save the design, verification time, and development cost. Previous work mainly focuses on modular floorplanning without module placement information. In this article, we propose a library-based placement and routing flow that best utilizes the pre-placed and routed modules from the library to significantly save the execution time while achieving the minimal area-delay product. The flow supports the static and reconfigurable modules at the same time. The modular information is represented in the B*-Tree structure, and the B*-Tree operations are amended together with Simulated Annealing to enable a fast search of the placement space. Different width-height ratios of the modules are exploited to achieve area-delay product optimization. Partial reconfiguration-aware routing using pin-to-wire abutment is proposed to connect the modules after placement. Our placer can reduce the compilation time by 65% on average with 17% area and 8.2% delay overhead compared with the fine-grained results of Versatile Place and Route through the reuse of module information in the library for the base architecture. For other architectures, the area increase ranges from 8.32% to 25.79%, the delay varies from − 13.66% to 19.79%, and the runtime improves by 43.31% to 77.2%.","PeriodicalId":7063,"journal":{"name":"ACM Trans. Design Autom. Electr. Syst.","volume":"89 1","pages":"71:1-71:26"},"PeriodicalIF":0.0000,"publicationDate":"2016-09-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"ACM Trans. Design Autom. Electr. Syst.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/2901295","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3

Abstract

While traditional Field-Programmable Gate Array design flow usually employs fine-grained tile-based placement, modular placement is increasingly required to speed up the large-scale placement and save the synthesis time. Moreover, the commonly used modules can be pre-synthesized and stored in the library for design reuse to significantly save the design, verification time, and development cost. Previous work mainly focuses on modular floorplanning without module placement information. In this article, we propose a library-based placement and routing flow that best utilizes the pre-placed and routed modules from the library to significantly save the execution time while achieving the minimal area-delay product. The flow supports the static and reconfigurable modules at the same time. The modular information is represented in the B*-Tree structure, and the B*-Tree operations are amended together with Simulated Annealing to enable a fast search of the placement space. Different width-height ratios of the modules are exploited to achieve area-delay product optimization. Partial reconfiguration-aware routing using pin-to-wire abutment is proposed to connect the modules after placement. Our placer can reduce the compilation time by 65% on average with 17% area and 8.2% delay overhead compared with the fine-grained results of Versatile Place and Route through the reuse of module information in the library for the base architecture. For other architectures, the area increase ranges from 8.32% to 25.79%, the delay varies from − 13.66% to 19.79%, and the runtime improves by 43.31% to 77.2%.
支持部分重构的fpga中基于库的布局和路由
传统的现场可编程门阵列设计流程通常采用细粒度的基于瓷砖的布局,而模块化布局越来越需要加快大规模布局并节省合成时间。此外,还可以将常用的模块预合成并存储在库中以供设计重用,从而大大节省了设计、验证时间和开发成本。以前的工作主要集中在模块化的平面规划上,没有模块的放置信息。在本文中,我们提出了一个基于库的放置和路由流,该流最好地利用了库中的预放置和路由模块,从而大大节省了执行时间,同时实现了最小的区域延迟产品。流同时支持静态模块和可重构模块。模块化信息以B*-Tree结构表示,并结合模拟退火对B*-Tree操作进行修正,实现了对放置空间的快速搜索。利用不同的模块宽高比来实现区域延迟产品的优化。提出了采用引脚-线基台的部分重构感知路由,用于模块放置后的连接。通过重用基本体系结构库中的模块信息,我们的placer与Versatile Place和Route的细粒度结果相比,平均减少了65%的编译时间,减少了17%的面积和8.2%的延迟开销。对于其他架构,面积增加了8.32% ~ 25.79%,延迟增加了- 13.66% ~ 19.79%,运行时间增加了43.31% ~ 77.2%。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
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学术官方微信