CRISP: Congestion reduction by iterated spreading during placement

Jarrod A. Roy, Natarajan Viswanathan, Gi-Joon Nam, C. Alpert, I. Markov
{"title":"CRISP: Congestion reduction by iterated spreading during placement","authors":"Jarrod A. Roy, Natarajan Viswanathan, Gi-Joon Nam, C. Alpert, I. Markov","doi":"10.1145/1687399.1687467","DOIUrl":null,"url":null,"abstract":"Dramatic progress has been made in algorithms for placement and routing over the last 5 years, with improvements in both speed and quality. Combining placement and routing into a joint optimization has also been proposed. However, it remains unclear if the benefits would be significant enough to justify major changes in commercial tools. CRISP addresses this challenge and is the first tool to demonstrate tangible benefits of combined place-and-route optimization including fewer global routing detours, reduced detailed routing violations and runtime, and even shrinking the floorplan of a commercial design. We employ fast global routing to choose standard cells to temporarily inflate and iteratively spread for congestion reduction. Spreading only in congested regions, we enable die area reduction by facilitating routing with high area utilization.","PeriodicalId":256358,"journal":{"name":"2009 IEEE/ACM International Conference on Computer-Aided Design - Digest of Technical Papers","volume":"27 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2009-11-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"54","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2009 IEEE/ACM International Conference on Computer-Aided Design - Digest of Technical Papers","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/1687399.1687467","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 54

Abstract

Dramatic progress has been made in algorithms for placement and routing over the last 5 years, with improvements in both speed and quality. Combining placement and routing into a joint optimization has also been proposed. However, it remains unclear if the benefits would be significant enough to justify major changes in commercial tools. CRISP addresses this challenge and is the first tool to demonstrate tangible benefits of combined place-and-route optimization including fewer global routing detours, reduced detailed routing violations and runtime, and even shrinking the floorplan of a commercial design. We employ fast global routing to choose standard cells to temporarily inflate and iteratively spread for congestion reduction. Spreading only in congested regions, we enable die area reduction by facilitating routing with high area utilization.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
CRISP:在放置期间通过迭代传播减少拥塞
在过去的5年里,布局和路由算法取得了巨大的进步,速度和质量都有所提高。提出了将布置和布线结合为一种联合优化方法。然而,目前尚不清楚这些好处是否足以证明商业工具的重大变化是合理的。CRISP解决了这一挑战,并且是第一个展示了位置和路线组合优化的切实好处的工具,包括减少全局路由绕道,减少详细的路由违规和运行时间,甚至缩小了商业设计的平面图。我们采用快速全局路由选择标准单元进行临时膨胀和迭代传播,以减少拥塞。仅在拥挤区域传播,我们通过促进高区域利用率的路由来减少模具面积。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
CiteScore
4.60
自引率
0.00%
发文量
0
期刊最新文献
Optimal layer assignment for escape routing of buses Post-fabrication measurement-driven oxide breakdown reliability prediction and management Resilience in computer systems and networks Energy-optimal dynamic thermal management for green computing REMiS: Run-time energy minimization scheme in a reconfigurable processor with dynamic power-gated instruction 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