Integrating buffer planning with floorplanning for simultaneous multi-objective optimization

Yi-Hui Cheng, Yao-Wen Chang
{"title":"Integrating buffer planning with floorplanning for simultaneous multi-objective optimization","authors":"Yi-Hui Cheng, Yao-Wen Chang","doi":"10.1109/ASPDAC.2004.1337667","DOIUrl":null,"url":null,"abstract":"As the process technology advances into the deep submicron era, interconnect plays a dominant role in determining circuit performance and signal integrity. Buffer insertion is one of the most effective and popular techniques to reduce interconnnect delay and decouple coupling effects. It is traditionally applied to post-layout optimization. However, it is obviously infeasible to insert hundreds of thousands buffers during the post-layout starge when most routing regions are occupied. Therefore, it is desirable to incorporate buffer planning into floor-planning to ensure thiming closure and design convergence. In this paper, we drive the formulae of feasible regions, and integrate buffer planning with floor-planning to optimize area, timing, noise, and congestion (routability) simultaneously. In particular, we treat each buffer block as a soft module and apply Lagragian relaxation to optimize the floorplan area. Experimental results show that our method obtains an average suceess rate of 94.9% (86.4%) of nets meeting timimg constraint alone (both timing and noise constraints)and consumes an average extra area of only 0.1% (0.2%) over the given floorplan.","PeriodicalId":426349,"journal":{"name":"ASP-DAC 2004: Asia and South Pacific Design Automation Conference 2004 (IEEE Cat. No.04EX753)","volume":"26 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2004-01-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"10","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"ASP-DAC 2004: Asia and South Pacific Design Automation Conference 2004 (IEEE Cat. No.04EX753)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ASPDAC.2004.1337667","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 10

Abstract

As the process technology advances into the deep submicron era, interconnect plays a dominant role in determining circuit performance and signal integrity. Buffer insertion is one of the most effective and popular techniques to reduce interconnnect delay and decouple coupling effects. It is traditionally applied to post-layout optimization. However, it is obviously infeasible to insert hundreds of thousands buffers during the post-layout starge when most routing regions are occupied. Therefore, it is desirable to incorporate buffer planning into floor-planning to ensure thiming closure and design convergence. In this paper, we drive the formulae of feasible regions, and integrate buffer planning with floor-planning to optimize area, timing, noise, and congestion (routability) simultaneously. In particular, we treat each buffer block as a soft module and apply Lagragian relaxation to optimize the floorplan area. Experimental results show that our method obtains an average suceess rate of 94.9% (86.4%) of nets meeting timimg constraint alone (both timing and noise constraints)and consumes an average extra area of only 0.1% (0.2%) over the given floorplan.
将缓冲区规划与楼层规划相结合,同时进行多目标优化
随着工艺技术进入深亚微米时代,互连在决定电路性能和信号完整性方面发挥着主导作用。缓冲器插入是减少互连延迟和去耦合效应的最有效、最流行的技术之一。它传统上应用于布局后优化。然而,在大多数布线区域已被占用的情况下,在布局后启动期间插入成百上千个缓冲区显然是不可行的。因此,我们希望将缓冲区规划纳入布局规划,以确保定时闭合和设计收敛。在本文中,我们提出了可行区域公式,并将缓冲区规划与平面规划相结合,以同时优化面积、时序、噪声和拥塞(可布线性)。具体而言,我们将每个缓冲区块视为一个软模块,并应用拉格朗日松弛法来优化平面规划面积。实验结果表明,我们的方法仅在满足定时约束(同时满足定时和噪声约束)的情况下,就能获得平均 94.9% (86.4%) 的网络成功率,并且在给定平面图上平均仅消耗 0.1% (0.2%) 的额外面积。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信