A "Greedy" Channel Router

Ronald L. Rivest, C. M. Fiduccia
{"title":"A \"Greedy\" Channel Router","authors":"Ronald L. Rivest, C. M. Fiduccia","doi":"10.1145/62882.62912","DOIUrl":null,"url":null,"abstract":"We present a new, \"greedy\", channel-router that is quick, simple, and highly effective. It always succeeds, usually using no more than one track more than required by channel density. (It may be forced in rare cases to make a few connections \"off the end\" of the channel, in order to succeed.) It assumes that all pins and wiring lie on a common grid, and that vertical wires are on one layer, horizontal on another. The greedy router wires up the channel in a left-to-right, column-by-column manner, wiring each column completely before starting the next. Within each column the router tries to maximize the utility of the wiring produced, using simple, \"greedy\" heuristics. It may place a net on more than one track for a few columns, and \"collapse\" the net to a single track later on, using a vertical jog. It may also use a jog to move a net to a track closer to its pin in some future column. The router may occasionally add a new track to the channel, to avoid \"getting stuck\".","PeriodicalId":290739,"journal":{"name":"19th Design Automation Conference","volume":"44 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1983-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"324","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"19th Design Automation Conference","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/62882.62912","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 324

Abstract

We present a new, "greedy", channel-router that is quick, simple, and highly effective. It always succeeds, usually using no more than one track more than required by channel density. (It may be forced in rare cases to make a few connections "off the end" of the channel, in order to succeed.) It assumes that all pins and wiring lie on a common grid, and that vertical wires are on one layer, horizontal on another. The greedy router wires up the channel in a left-to-right, column-by-column manner, wiring each column completely before starting the next. Within each column the router tries to maximize the utility of the wiring produced, using simple, "greedy" heuristics. It may place a net on more than one track for a few columns, and "collapse" the net to a single track later on, using a vertical jog. It may also use a jog to move a net to a track closer to its pin in some future column. The router may occasionally add a new track to the channel, to avoid "getting stuck".
一个“贪婪”通道路由器
我们提出了一种新的、“贪婪”的通道路由器,它快速、简单、高效。它总是成功的,通常使用不超过通道密度要求的一个轨道。(在极少数情况下,为了成功,它可能会被迫在通道的“末端”建立一些连接。)它假设所有的引脚和电线都在一个共同的网格上,垂直的电线在一层,水平的在另一层。贪婪路由器以从左到右、一列接一列的方式连接通道,在开始下一列之前完全连接每一列。在每一列中,路由器尝试使用简单的“贪婪”启发式来最大化所产生的布线的效用。它可以将网放置在多个轨道上,用于几列,然后使用垂直慢跑将网“折叠”到单个轨道上。在未来的专栏中,它也可能使用慢跑将网移动到更靠近其销钉的轨道上。路由器可能偶尔会向信道添加一条新轨道,以避免“卡住”。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术文献互助群
群 号:604180095
Book学术官方微信