Non-Manhattan maze routing

M. Stan, F. Hamzaoglu, David Garrett
{"title":"Non-Manhattan maze routing","authors":"M. Stan, F. Hamzaoglu, David Garrett","doi":"10.1145/1016568.1016637","DOIUrl":null,"url":null,"abstract":"The availability of multiple metal layers in modern IC processes raises the possibility of using non-Manhattan routing on some of the layers in order to reduce the average interconnect length, and thus improve performance and routability. In this paper, we present novel algorithms for both Manhattan and non-Manhattan multi-layer maze routing. The algorithms in principle can be extended to an arbitrary number of layers, but the paper focuses on four-layer routing, two in horizontal and two in vertical directions for Manhattan, and one layer each in horizontal, vertical, 45-degree and 135-degree directions for non-Manhattan routing. The non-Manhattan algorithms show an improvement of up to 12.2% in average wire length compared to Manhattan routing for two general MCNC benchmarks.","PeriodicalId":275811,"journal":{"name":"Proceedings. SBCCI 2004. 17th Symposium on Integrated Circuits and Systems Design (IEEE Cat. No.04TH8784)","volume":"27 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2004-09-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"10","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings. SBCCI 2004. 17th Symposium on Integrated Circuits and Systems Design (IEEE Cat. No.04TH8784)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/1016568.1016637","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 10

Abstract

The availability of multiple metal layers in modern IC processes raises the possibility of using non-Manhattan routing on some of the layers in order to reduce the average interconnect length, and thus improve performance and routability. In this paper, we present novel algorithms for both Manhattan and non-Manhattan multi-layer maze routing. The algorithms in principle can be extended to an arbitrary number of layers, but the paper focuses on four-layer routing, two in horizontal and two in vertical directions for Manhattan, and one layer each in horizontal, vertical, 45-degree and 135-degree directions for non-Manhattan routing. The non-Manhattan algorithms show an improvement of up to 12.2% in average wire length compared to Manhattan routing for two general MCNC benchmarks.
非曼哈顿迷宫路线
现代IC工艺中多金属层的可用性提高了在某些层上使用非曼哈顿路由的可能性,以减少平均互连长度,从而提高性能和可达性。本文提出了适用于曼哈顿和非曼哈顿多层迷宫路径的新算法。这些算法原则上可以扩展到任意层数,但本文主要研究四层路由,曼哈顿方向两层水平两层垂直,非曼哈顿方向各一层水平、垂直、45度和135度方向。在两个通用MCNC基准测试中,与曼哈顿路由相比,非曼哈顿算法的平均线长提高了12.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学术官方微信