Connectivity biased channel construction and ordering for building-block layout

H. Cai
{"title":"Connectivity biased channel construction and ordering for building-block layout","authors":"H. Cai","doi":"10.1109/DAC.1988.14816","DOIUrl":null,"url":null,"abstract":"A number of techniques are presented for the construction and ordering of routing channels for building-block layout. Before the routing channels are defined, the placement is modified so that proper routing space is assigned between the circuit blocks. A channel graph is then constructed on which the global routing will be performed. After the global routing a feasible routing order is assigned to the channels., In contrast to other approaches, the algorithms use both the geometrical data (the placement) and the topological data (the connectivity) to decide which channel structure should be chosen from the feasible set.<<ETX>>","PeriodicalId":230716,"journal":{"name":"25th ACM/IEEE, Design Automation Conference.Proceedings 1988.","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1988-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"14","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"25th ACM/IEEE, Design Automation Conference.Proceedings 1988.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/DAC.1988.14816","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 14

Abstract

A number of techniques are presented for the construction and ordering of routing channels for building-block layout. Before the routing channels are defined, the placement is modified so that proper routing space is assigned between the circuit blocks. A channel graph is then constructed on which the global routing will be performed. After the global routing a feasible routing order is assigned to the channels., In contrast to other approaches, the algorithms use both the geometrical data (the placement) and the topological data (the connectivity) to decide which channel structure should be chosen from the feasible set.<>
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
连接偏置的通道构建和构建块布局的排序
提出了用于构建块布局的路由通道的构造和排序的一些技术。在定义路由通道之前,修改放置,以便在电路块之间分配适当的路由空间。然后构建一个通道图,在该通道图上执行全局路由。全局路由完成后,为通道分配一个可行的路由顺序。与其他方法相比,该算法同时使用几何数据(位置)和拓扑数据(连通性)来决定应该从可行集中选择哪个通道结构
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Automatic building of graphs for rectangular dualisation (IC floorplanning) Parameterized schematics (VLSI) Experience with the VHDL environment LocusRoute: a parallel global router for standard cells How to obtain more compactable channel routing solutions
×
引用
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