多层信道路由问题的一种新的有效方法

S. Fang, Wu-Shiung Feng, Shian-Lang Lee
{"title":"多层信道路由问题的一种新的有效方法","authors":"S. Fang, Wu-Shiung Feng, Shian-Lang Lee","doi":"10.1109/DAC.1992.227819","DOIUrl":null,"url":null,"abstract":"A very efficient multilayer channel router, the M/sup 3/CR, is described. The goal of M/sup 3/CR is to use an optimum number of tracks for any multilayer routing instance in the dogleg-free routing model. M/sup 3/CR has a simple time complexity because it is not a maze-running-based router. The experiment demonstrated that M/sup 3/CR produced an optimum number of tracks for all the test examples from 4 through 8 layers in a very short time. The variable-wire-width consideration based on the design rules is discussed.<<ETX>>","PeriodicalId":162648,"journal":{"name":"[1992] Proceedings 29th ACM/IEEE Design Automation Conference","volume":"2 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1992-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"21","resultStr":"{\"title\":\"A new efficient approach to multilayer channel routing problem\",\"authors\":\"S. Fang, Wu-Shiung Feng, Shian-Lang Lee\",\"doi\":\"10.1109/DAC.1992.227819\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A very efficient multilayer channel router, the M/sup 3/CR, is described. The goal of M/sup 3/CR is to use an optimum number of tracks for any multilayer routing instance in the dogleg-free routing model. M/sup 3/CR has a simple time complexity because it is not a maze-running-based router. The experiment demonstrated that M/sup 3/CR produced an optimum number of tracks for all the test examples from 4 through 8 layers in a very short time. The variable-wire-width consideration based on the design rules is discussed.<<ETX>>\",\"PeriodicalId\":162648,\"journal\":{\"name\":\"[1992] Proceedings 29th ACM/IEEE Design Automation Conference\",\"volume\":\"2 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1992-07-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"21\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"[1992] Proceedings 29th ACM/IEEE Design Automation Conference\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/DAC.1992.227819\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"[1992] Proceedings 29th ACM/IEEE Design Automation Conference","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/DAC.1992.227819","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 21

摘要

介绍了一种非常高效的多层通道路由器M/sup 3/CR。M/sup 3/CR的目标是在无狗腿路由模型中为任何多层路由实例使用最优的轨道数。M/sup 3/CR具有简单的时间复杂度,因为它不是一个基于迷宫运行的路由器。实验表明,M/sup 3/CR在很短的时间内为4到8层的所有测试样例产生了最优的轨道数量。讨论了基于设计规则的变线宽考虑。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
A new efficient approach to multilayer channel routing problem
A very efficient multilayer channel router, the M/sup 3/CR, is described. The goal of M/sup 3/CR is to use an optimum number of tracks for any multilayer routing instance in the dogleg-free routing model. M/sup 3/CR has a simple time complexity because it is not a maze-running-based router. The experiment demonstrated that M/sup 3/CR produced an optimum number of tracks for all the test examples from 4 through 8 layers in a very short time. The variable-wire-width consideration based on the design rules is discussed.<>
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术文献互助群
群 号:604180095
Book学术官方微信