Practical Approach to Cell Replacement for Resolving Pin Inaccessibility

Suwan Kim, Taewhan Kim
{"title":"Practical Approach to Cell Replacement for Resolving Pin Inaccessibility","authors":"Suwan Kim, Taewhan Kim","doi":"10.1109/MWSCAS47672.2021.9531691","DOIUrl":null,"url":null,"abstract":"We propose a practical approach to the cell replacement problem for resolving the pin inaccessibility in the ECO (engineering-change-order) routing stage. The prior cell replacement method performs in two steps: (i) it prepares a subsidiary (i.e., alternative) cell library that includes for each cell type a set of diverse cell layouts. Then, (ii) it iteratively tries to replace the cells of routing failures with some cells in the subsidiary library during ECO routing in order to fix the routing failures. In this work, we downsize the subsidiary library produced in step (i) to speed up the sequential and time-consuming process of step (ii). Precisely, we propose a function based on the well-known formulation of Levenshtein distance to measure the degree of the pin topology difference between the layout of a cell type in the target library and a layout of the same type in the subsidiary library. Then, we update the subsidiary library to include, for each cell type, exactly one layout that has the biggest pin topology difference. Through experiments with benchmark circuits, it is shown that using the subsidiary library produced by our topology difference formulation enables to reduce the number of trials of cell replacements significantly over the conventional method while fixing almost the same amount of routing violations.","PeriodicalId":6792,"journal":{"name":"2021 IEEE International Midwest Symposium on Circuits and Systems (MWSCAS)","volume":"34 1","pages":"224-227"},"PeriodicalIF":0.0000,"publicationDate":"2021-08-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2021 IEEE International Midwest Symposium on Circuits and Systems (MWSCAS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/MWSCAS47672.2021.9531691","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

We propose a practical approach to the cell replacement problem for resolving the pin inaccessibility in the ECO (engineering-change-order) routing stage. The prior cell replacement method performs in two steps: (i) it prepares a subsidiary (i.e., alternative) cell library that includes for each cell type a set of diverse cell layouts. Then, (ii) it iteratively tries to replace the cells of routing failures with some cells in the subsidiary library during ECO routing in order to fix the routing failures. In this work, we downsize the subsidiary library produced in step (i) to speed up the sequential and time-consuming process of step (ii). Precisely, we propose a function based on the well-known formulation of Levenshtein distance to measure the degree of the pin topology difference between the layout of a cell type in the target library and a layout of the same type in the subsidiary library. Then, we update the subsidiary library to include, for each cell type, exactly one layout that has the biggest pin topology difference. Through experiments with benchmark circuits, it is shown that using the subsidiary library produced by our topology difference formulation enables to reduce the number of trials of cell replacements significantly over the conventional method while fixing almost the same amount of routing violations.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
解决引脚不可接近问题的实用电池替换方法
我们提出了一种实用的方法来解决在ECO(工程换序)布线阶段的引脚不可达性问题。先前的单元格替换方法分两步执行:(i)它准备一个附属(即替代)单元格库,其中包括每种单元格类型的一组不同的单元格布局。然后,(ii)在ECO路由过程中,迭代尝试用子库中的一些单元替换路由失败的单元,以修复路由失败。在这项工作中,我们缩小了步骤(i)中产生的子库,以加快步骤(ii)的顺序和耗时过程。准确地说,我们提出了一个基于著名的Levenshtein距离公式的函数,用于测量目标库中单元类型布局与子库中相同类型布局之间的引脚拓扑差异程度。然后,我们更新子库,以包含每个单元格类型的恰好一个具有最大引脚拓扑差异的布局。通过对基准电路的实验表明,使用我们的拓扑差异公式产生的附属库能够在修复几乎相同数量的路由违规的同时,比传统方法显着减少单元替换的试验次数。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Hybrid Frequency Domain Simulation Method to Speed-up Analysis of Injection Locked Oscillators SaFIoV: A Secure and Fast Communication in Fog-based Internet-of-Vehicles using SDN and Blockchain Capacitor-Less Memristive Integrate-and-Fire Neuron with Stochastic Behavior Polynomial Filters with Controllable Overshoot In Their Step Transient Responses A low kickback noise and low power dynamic comparator
×
引用
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