ECO Timing Optimization with Data Paths and Clock Paths Considered

Jia-Xiang Tang, Shih-Hsu Huang, Jui-Hung Hung
{"title":"ECO Timing Optimization with Data Paths and Clock Paths Considered","authors":"Jia-Xiang Tang, Shih-Hsu Huang, Jui-Hung Hung","doi":"10.1109/ISPACS51563.2021.9650994","DOIUrl":null,"url":null,"abstract":"Metal-only ECO (engineering change order) is an important process for timing optimization after the layout has been completed. To fix timing violations, previous works use spare cells to revise data paths. Different from previous works, in this paper, we propose a new approach to fix timing violations by considering both data paths and clock paths. The proposed algorithm creates a candidate list (from both data paths and clock paths) based on current timing conditions and spare cell data, and then it calculates the costs to select the best revision method. The algorithm repeats until no further improvement can be made. Experiment results show that the proposed approach can achieve better timing results than previous works.","PeriodicalId":359822,"journal":{"name":"2021 International Symposium on Intelligent Signal Processing and Communication Systems (ISPACS)","volume":"79 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2021-11-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2021 International Symposium on Intelligent Signal Processing and Communication Systems (ISPACS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISPACS51563.2021.9650994","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

Metal-only ECO (engineering change order) is an important process for timing optimization after the layout has been completed. To fix timing violations, previous works use spare cells to revise data paths. Different from previous works, in this paper, we propose a new approach to fix timing violations by considering both data paths and clock paths. The proposed algorithm creates a candidate list (from both data paths and clock paths) based on current timing conditions and spare cell data, and then it calculates the costs to select the best revision method. The algorithm repeats until no further improvement can be made. Experiment results show that the proposed approach can achieve better timing results than previous works.
考虑数据路径和时钟路径的ECO时序优化
纯金属ECO(工程变更单)是布局完成后进行时序优化的重要过程。为了解决时间冲突,以前的工作使用备用单元来修改数据路径。与以往的工作不同,在本文中,我们提出了一种同时考虑数据路径和时钟路径来修复时间冲突的新方法。该算法基于当前时序条件和备用单元数据创建候选列表(从数据路径和时钟路径),然后计算成本以选择最佳修正方法。该算法重复,直到没有进一步的改进。实验结果表明,该方法能取得较好的定时效果。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信