A device-agnostic tool for precomputing legal placements in modular design flows

A. A. Sohanghpurwala, P. Athanas, A. Love
{"title":"A device-agnostic tool for precomputing legal placements in modular design flows","authors":"A. A. Sohanghpurwala, P. Athanas, A. Love","doi":"10.1109/ReConFig.2014.7032551","DOIUrl":null,"url":null,"abstract":"Recent research aiming to improve FPGA productivity has focused on modular design flows where modules can be compiled into a library of blocks that can be used to rapidly assemble designs. Rapid assembly is possible because compute intensive tasks, such as detailed local placement, are handled at module compile time. This paper presents a tool known as a preplacer that computes and stores all possible legal placements of a module at module compile time. The tool presented here distinguishes itself from previous efforts to solve the same problem by leveraging the open-source TORC device databases to support all modern Xilinx devices without manually extracting the RPM grid. Legal placements are calculated efficiently by first compressing the FPGA tile layout and then using a multi-step approach to eliminate illegal placements. The preplacer run-time is insignificant within the scope of module compilation times and quality of results are comparable to the previous architecture specific implementation.","PeriodicalId":137331,"journal":{"name":"2014 International Conference on ReConFigurable Computing and FPGAs (ReConFig14)","volume":"30 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2014 International Conference on ReConFigurable Computing and FPGAs (ReConFig14)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ReConFig.2014.7032551","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

Recent research aiming to improve FPGA productivity has focused on modular design flows where modules can be compiled into a library of blocks that can be used to rapidly assemble designs. Rapid assembly is possible because compute intensive tasks, such as detailed local placement, are handled at module compile time. This paper presents a tool known as a preplacer that computes and stores all possible legal placements of a module at module compile time. The tool presented here distinguishes itself from previous efforts to solve the same problem by leveraging the open-source TORC device databases to support all modern Xilinx devices without manually extracting the RPM grid. Legal placements are calculated efficiently by first compressing the FPGA tile layout and then using a multi-step approach to eliminate illegal placements. The preplacer run-time is insignificant within the scope of module compilation times and quality of results are comparable to the previous architecture specific implementation.
一个设备不可知的工具,用于在模块化设计流程中预先计算合法位置
最近旨在提高FPGA生产效率的研究主要集中在模块化设计流程上,其中模块可以编译成可用于快速组装设计的模块库。快速汇编是可能的,因为计算密集型任务(如详细的局部放置)在模块编译时处理。本文介绍了一个被称为preplacer的工具,它在模块编译时计算并存储模块的所有可能的合法位置。这里提供的工具与以前解决相同问题的方法不同,它利用开源的TORC设备数据库来支持所有现代Xilinx设备,而无需手动提取RPM网格。通过首先压缩FPGA平铺布局,然后使用多步方法消除非法放置,有效地计算出合法放置。preplacer运行时在模块编译时间和结果质量的范围内是微不足道的,与之前的特定于体系结构的实现相当。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术文献互助群
群 号:604180095
Book学术官方微信