Canonical ordering of instances to immunize the FPGA place and route flow from ECO-induced variance

Avijit Dutta, Neil Tuttle, K. Anandh
{"title":"Canonical ordering of instances to immunize the FPGA place and route flow from ECO-induced variance","authors":"Avijit Dutta, Neil Tuttle, K. Anandh","doi":"10.1109/ISQED.2013.6523635","DOIUrl":null,"url":null,"abstract":"Engineering change order (ECO)s for FPGA-based designs often require design changes late in the design process in order to correct functional, timing, and/or technological problems. Typically, after an ECO process a small portion of the circuit netlist is changed. To take advantage of the enormous resources and time already spent on place and route flow, it is desirable to maintain similar post-routing delay characteristics to the pre-ECO stage to avoid further expensive design iterations. Most FPGA tools use the variance to their advantage to explore the solution space in the design optimization phase. FPGA companies can afford to run multiple passes and just retain the best solution. The embedded systems companies cannot afford multiple pass compile times especially in ECO situations. Note that the variance reduction technique proposed in this paper is applicable only in the ECO situations and not during design optimization phase where variance plays an advantageous role. Predictability is not just unique to ECO, but success of an ECO is highly dependent on predictability and that's where the proposed approach plays a crucial role. The ECO process may change a small subset of the circuit netlist, which may result in a minor variation in the instance list order seen by the packer. Most packing heuristics, including fast greedy heuristics as well as relatively slower non-greedy heuristics, process the input netlist in a certain order and have varying degrees of dependence on the initial instance order. Even a slight variation may result in a substantially different packing and the subsequent placement and routing results may also change. In the worst case, the post-routing delay may fail timing constraints and require inexpensive design iteration. In this paper, we propose a fast canonical ordering technique that either guarantees a unique instance order if the ECO process caused a change in the initial instance order or minimizes the perturbation to the instance order as seen by the packer stage from any significant ECO-induced change to the initial instance order. This helps in isolating the postpacker place and route flow from netlist changes and drastically reduces the variance in post routing delay. Experimental results demonstrate zero variance against random shuffling of instances before the packer stage (to simulate an ECO scenario). Experimental results for other non-functional or slight functional modifications to the input netlist show greatly reduced post-routing delay variance.","PeriodicalId":127115,"journal":{"name":"International Symposium on Quality Electronic Design (ISQED)","volume":"49 4 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2013-03-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Symposium on Quality Electronic Design (ISQED)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISQED.2013.6523635","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

Engineering change order (ECO)s for FPGA-based designs often require design changes late in the design process in order to correct functional, timing, and/or technological problems. Typically, after an ECO process a small portion of the circuit netlist is changed. To take advantage of the enormous resources and time already spent on place and route flow, it is desirable to maintain similar post-routing delay characteristics to the pre-ECO stage to avoid further expensive design iterations. Most FPGA tools use the variance to their advantage to explore the solution space in the design optimization phase. FPGA companies can afford to run multiple passes and just retain the best solution. The embedded systems companies cannot afford multiple pass compile times especially in ECO situations. Note that the variance reduction technique proposed in this paper is applicable only in the ECO situations and not during design optimization phase where variance plays an advantageous role. Predictability is not just unique to ECO, but success of an ECO is highly dependent on predictability and that's where the proposed approach plays a crucial role. The ECO process may change a small subset of the circuit netlist, which may result in a minor variation in the instance list order seen by the packer. Most packing heuristics, including fast greedy heuristics as well as relatively slower non-greedy heuristics, process the input netlist in a certain order and have varying degrees of dependence on the initial instance order. Even a slight variation may result in a substantially different packing and the subsequent placement and routing results may also change. In the worst case, the post-routing delay may fail timing constraints and require inexpensive design iteration. In this paper, we propose a fast canonical ordering technique that either guarantees a unique instance order if the ECO process caused a change in the initial instance order or minimizes the perturbation to the instance order as seen by the packer stage from any significant ECO-induced change to the initial instance order. This helps in isolating the postpacker place and route flow from netlist changes and drastically reduces the variance in post routing delay. Experimental results demonstrate zero variance against random shuffling of instances before the packer stage (to simulate an ECO scenario). Experimental results for other non-functional or slight functional modifications to the input netlist show greatly reduced post-routing delay variance.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
规范的实例排序,使FPGA的位置和路由流免受eco引起的变化
基于fpga设计的工程变更令(ECO)通常要求在设计过程的后期进行设计变更,以纠正功能、时间和/或技术问题。通常,在一个ECO过程之后,电路网表的一小部分被改变。为了充分利用已经花费在地点和路线流上的大量资源和时间,最好保持与eco前阶段相似的路由后延迟特性,以避免进一步昂贵的设计迭代。大多数FPGA工具利用方差来探索设计优化阶段的解决方案空间。FPGA公司可以负担得起运行多个通道并保留最佳解决方案。嵌入式系统公司无法承受多次通过编译时间,特别是在ECO情况下。请注意,本文提出的方差减小技术仅适用于ECO情况,而不适用于方差发挥优势作用的设计优化阶段。可预测性不仅仅是ECO所独有的,ECO的成功也高度依赖于可预测性,这就是建议的方法发挥关键作用的地方。ECO过程可能会改变电路网络列表的一小部分,这可能会导致封隔器看到的实例列表顺序发生微小变化。大多数包装启发式,包括快速的贪婪启发式和相对较慢的非贪婪启发式,都以一定的顺序处理输入网表,并且对初始实例顺序有不同程度的依赖。即使是微小的变化也可能导致包装的巨大差异,随后的放置和布线结果也可能发生变化。在最坏的情况下,路由后延迟可能无法满足时间限制,并且需要廉价的设计迭代。在本文中,我们提出了一种快速规范排序技术,如果ECO过程引起初始实例顺序的变化,该技术可以保证唯一的实例顺序,或者最小化从ECO引起的任何重大变化到初始实例顺序的封隔器阶段所看到的对实例顺序的扰动。这有助于隔离寄件人的地方和路由流从网表的变化,并大大减少变化后路由延迟。实验结果表明,在封隔器阶段(模拟ECO场景)之前,对随机洗牌实例的方差为零。对输入网表进行其他非功能性或轻微功能性修改的实验结果表明,路由后延迟方差大大降低。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Fast FPGA-based fault injection tool for embedded processors Effective thermal control techniques for liquid-cooled 3D multi-core processors Analysis and reliability test to improve the data retention performance of EPROM circuits Increasing the security level of analog IPs by using a dedicated vulnerability analysis methodology Easy-to-build Arbiter Physical Unclonable Function with enhanced challenge/response set
×
引用
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