一个“无网格”通道路由器

Koji Sato, Hiroyoshi Shimoyama, Takao Nagai, M. Ozaki, T. Yahara
{"title":"一个“无网格”通道路由器","authors":"Koji Sato, Hiroyoshi Shimoyama, Takao Nagai, M. Ozaki, T. Yahara","doi":"10.1145/800139.804508","DOIUrl":null,"url":null,"abstract":"A \"grid-free\" channel router (termed GFR) is reported. GFR does not employ grid lines and can obtain better results than the fixed-grid method. Additionally, GFR has several optional functions, such as \"constraint loop breaking\", \"total branch length minimization\", \"constraint chain cutting\" and \"layer changing\". The algorithms of these functions are outlined and results obtained by using them are presented.","PeriodicalId":196513,"journal":{"name":"17th Design Automation Conference","volume":"45 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1980-06-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"19","resultStr":"{\"title\":\"A \\\"Grid-free\\\" Channel Router\",\"authors\":\"Koji Sato, Hiroyoshi Shimoyama, Takao Nagai, M. Ozaki, T. Yahara\",\"doi\":\"10.1145/800139.804508\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A \\\"grid-free\\\" channel router (termed GFR) is reported. GFR does not employ grid lines and can obtain better results than the fixed-grid method. Additionally, GFR has several optional functions, such as \\\"constraint loop breaking\\\", \\\"total branch length minimization\\\", \\\"constraint chain cutting\\\" and \\\"layer changing\\\". The algorithms of these functions are outlined and results obtained by using them are presented.\",\"PeriodicalId\":196513,\"journal\":{\"name\":\"17th Design Automation Conference\",\"volume\":\"45 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1980-06-23\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"19\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"17th Design Automation Conference\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/800139.804508\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"17th Design Automation Conference","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/800139.804508","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 19

摘要

报道了一种“无网格”通道路由器(称为GFR)。GFR不使用网格线,比固定网格法能获得更好的结果。此外,GFR还具有“约束断环”、“总分支长度最小化”、“约束断链”、“换层”等可选功能。概述了这些函数的算法,并给出了使用它们得到的结果。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
A "Grid-free" Channel Router
A "grid-free" channel router (termed GFR) is reported. GFR does not employ grid lines and can obtain better results than the fixed-grid method. Additionally, GFR has several optional functions, such as "constraint loop breaking", "total branch length minimization", "constraint chain cutting" and "layer changing". The algorithms of these functions are outlined and results obtained by using them are presented.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信