Incremental Lagrangian Relaxation based Discrete Gate Sizing and Threshold Voltage Assignment

Dimitrios Mangiras, G. Dimitrakopoulos
{"title":"Incremental Lagrangian Relaxation based Discrete Gate Sizing and Threshold Voltage Assignment","authors":"Dimitrios Mangiras, G. Dimitrakopoulos","doi":"10.1109/MOCAST52088.2021.9493338","DOIUrl":null,"url":null,"abstract":"Timing closure remains one of the most critical challenges of a physical synthesis flow. Even if timing is almost closed at the end of the flow, last-mile placement and routing congestion optimizations may introduce new timing violations. Correcting such violations needs minimally disruptive techniques such as threshold voltage re-assignment and gate sizing that affect only marginally the placement and routing of the almost finalized design. To this end, we transform a powerful Lagrangian-relaxation-based optimizer, used for global timing optimizations at the early stages of the design flow, to a practical incremental timing optimizer that corrects small timing violations with fast runtime and without increasing the area/power of the design. By applying the proposed approach to the optimized designs of the ISPD 2013 gate sizing contest that experience new timing violations due to local wire rerouting, we improve timing by more than 36% on average, using 45% less runtime, when compared to the fully-fledged version of the timing optimizer.","PeriodicalId":146990,"journal":{"name":"2021 10th International Conference on Modern Circuits and Systems Technologies (MOCAST)","volume":"55 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2021-07-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2021 10th International Conference on Modern Circuits and Systems Technologies (MOCAST)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/MOCAST52088.2021.9493338","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3

Abstract

Timing closure remains one of the most critical challenges of a physical synthesis flow. Even if timing is almost closed at the end of the flow, last-mile placement and routing congestion optimizations may introduce new timing violations. Correcting such violations needs minimally disruptive techniques such as threshold voltage re-assignment and gate sizing that affect only marginally the placement and routing of the almost finalized design. To this end, we transform a powerful Lagrangian-relaxation-based optimizer, used for global timing optimizations at the early stages of the design flow, to a practical incremental timing optimizer that corrects small timing violations with fast runtime and without increasing the area/power of the design. By applying the proposed approach to the optimized designs of the ISPD 2013 gate sizing contest that experience new timing violations due to local wire rerouting, we improve timing by more than 36% on average, using 45% less runtime, when compared to the fully-fledged version of the timing optimizer.
基于增量拉格朗日松弛的离散栅极尺寸和阈值电压分配
定时关闭仍然是物理合成流中最关键的挑战之一。即使在流的末尾计时几乎关闭,最后一英里的位置和路由拥塞优化也可能引入新的计时违规。纠正这种违规需要最小的破坏性技术,如阈值电压重新分配和栅极尺寸,仅影响几乎最终设计的放置和路由。为此,我们将一个强大的基于拉格朗日松弛的优化器(用于设计流程早期阶段的全局定时优化)转换为一个实用的增量定时优化器,该优化器可以在不增加设计面积/功率的情况下,通过快速运行来纠正小的定时违规。通过将所提出的方法应用于ISPD 2013门尺寸竞赛的优化设计中,与完全成熟的定时优化器相比,我们平均提高了36%以上的定时,减少了45%的运行时间。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信