基于面向拥塞灵活性的RSMT构建算法

Ziyang Qi, Kun Ma, Qiang Zhou, Yici Cai
{"title":"基于面向拥塞灵活性的RSMT构建算法","authors":"Ziyang Qi, Kun Ma, Qiang Zhou, Yici Cai","doi":"10.1109/LASCAS.2014.6820275","DOIUrl":null,"url":null,"abstract":"As complexity of VLSI circuits grows, routability has been one of the key factors considered by tree construction algorithms in global routing. Flexibility is a geometric structural property of rectilinear Steiner minimal tree (RSMT), and it is expected to accord with routability and therefore predict the overflow situation. Reference [9] proposed a new definition of flexibility of RSMT, combining RSMT's original flexibility and genetic flexibility, and proved the efficiency of predicting routability utilizing experimental results. However, the flexibility is defined according to the RSMT structure, failing to consider different circumstances of congestion distribution. In order to fix this flaw, we propose the new concept of Congestion-Oriented Flexibility. Further, we propose an effective algorithm to enhance the generalized flexibility. Finally, an RSMT Construction Algorithm based on Congestion-Oriented Flexibility is proposed, which is demonstrated to create a routing result with 12.1% less congestion than FLUTE [1] and congestion-driven Steiner trees [2].","PeriodicalId":235336,"journal":{"name":"2014 IEEE 5th Latin American Symposium on Circuits and Systems","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2014-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"RSMT construction algorithm based on Congestion-Oriented Flexibility\",\"authors\":\"Ziyang Qi, Kun Ma, Qiang Zhou, Yici Cai\",\"doi\":\"10.1109/LASCAS.2014.6820275\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"As complexity of VLSI circuits grows, routability has been one of the key factors considered by tree construction algorithms in global routing. Flexibility is a geometric structural property of rectilinear Steiner minimal tree (RSMT), and it is expected to accord with routability and therefore predict the overflow situation. Reference [9] proposed a new definition of flexibility of RSMT, combining RSMT's original flexibility and genetic flexibility, and proved the efficiency of predicting routability utilizing experimental results. However, the flexibility is defined according to the RSMT structure, failing to consider different circumstances of congestion distribution. In order to fix this flaw, we propose the new concept of Congestion-Oriented Flexibility. Further, we propose an effective algorithm to enhance the generalized flexibility. Finally, an RSMT Construction Algorithm based on Congestion-Oriented Flexibility is proposed, which is demonstrated to create a routing result with 12.1% less congestion than FLUTE [1] and congestion-driven Steiner trees [2].\",\"PeriodicalId\":235336,\"journal\":{\"name\":\"2014 IEEE 5th Latin American Symposium on Circuits and Systems\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2014-02-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2014 IEEE 5th Latin American Symposium on Circuits and Systems\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/LASCAS.2014.6820275\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2014 IEEE 5th Latin American Symposium on Circuits and Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/LASCAS.2014.6820275","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

随着超大规模集成电路复杂度的不断提高,路由可达性已成为树形结构算法在全局路由中考虑的关键因素之一。柔性是线性斯坦纳最小树(RSMT)的一种几何结构性质,期望它符合可达性,从而预测溢出情况。文献[9]提出了RSMT灵活性的新定义,将RSMT原有的灵活性和遗传的灵活性结合起来,并利用实验结果证明了可达性预测的有效性。但是,灵活性是根据RSMT结构来定义的,没有考虑到拥塞分布的不同情况。为了弥补这一缺陷,我们提出了面向拥塞的灵活性的新概念。在此基础上,提出了一种有效的算法来提高系统的广义灵活性。最后,提出了一种基于面向拥塞灵活性的RSMT构造算法,该算法创建的路由结果比FLUTE[1]和拥塞驱动的Steiner树[2]的拥塞减少12.1%。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
RSMT construction algorithm based on Congestion-Oriented Flexibility
As complexity of VLSI circuits grows, routability has been one of the key factors considered by tree construction algorithms in global routing. Flexibility is a geometric structural property of rectilinear Steiner minimal tree (RSMT), and it is expected to accord with routability and therefore predict the overflow situation. Reference [9] proposed a new definition of flexibility of RSMT, combining RSMT's original flexibility and genetic flexibility, and proved the efficiency of predicting routability utilizing experimental results. However, the flexibility is defined according to the RSMT structure, failing to consider different circumstances of congestion distribution. In order to fix this flaw, we propose the new concept of Congestion-Oriented Flexibility. Further, we propose an effective algorithm to enhance the generalized flexibility. Finally, an RSMT Construction Algorithm based on Congestion-Oriented Flexibility is proposed, which is demonstrated to create a routing result with 12.1% less congestion than FLUTE [1] and congestion-driven Steiner trees [2].
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Memory energy consumption reduction in video coding systems Hardware implementation of the Smith-Waterman algorithm using a systolic architecture HEVC Fractional Motion Estimation complexity reduction for real-time applications High-sensitivity split-contact magnetoresistors on lightly doped silicon substrates Analysis of pure- and mixed-mode class-B outphasing amplifiers
×
引用
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