A new global routing algorithm for over-the-cell routing in standard cell layouts

T. Koide, S. Wakabayashi, N. Yoshida
{"title":"A new global routing algorithm for over-the-cell routing in standard cell layouts","authors":"T. Koide, S. Wakabayashi, N. Yoshida","doi":"10.1109/EURDAC.1993.410625","DOIUrl":null,"url":null,"abstract":"The authors present a new global routing algorithm for over-the-cell routing in standard cell layout, which determines global routes for each net both in channels and on over-the-cell regions. The goal of the algorithm is to minimize the total channel height in the final lyout. The proposed algorithm is implemented in the C language on a SPARC station 2 and tested with the benchmarks distributed from MCNC, whose cell placements were generated with TimberWolfSC4.2c. Experimental results show that the new routing algorithm reduces the channel height by about 13.1% compared to the conventional routing algorithm.<<ETX>>","PeriodicalId":339176,"journal":{"name":"Proceedings of EURO-DAC 93 and EURO-VHDL 93- European Design Automation Conference","volume":"14 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1993-09-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of EURO-DAC 93 and EURO-VHDL 93- European Design Automation Conference","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/EURDAC.1993.410625","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3

Abstract

The authors present a new global routing algorithm for over-the-cell routing in standard cell layout, which determines global routes for each net both in channels and on over-the-cell regions. The goal of the algorithm is to minimize the total channel height in the final lyout. The proposed algorithm is implemented in the C language on a SPARC station 2 and tested with the benchmarks distributed from MCNC, whose cell placements were generated with TimberWolfSC4.2c. Experimental results show that the new routing algorithm reduces the channel height by about 13.1% compared to the conventional routing algorithm.<>
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
标准小区布局下的跨小区路由新全局路由算法
提出了一种标准小区布局下的超小区路由全局路由算法,该算法既确定信道内的全局路由,又确定超小区区域内的全局路由。该算法的目标是最小化最终布局中的总通道高度。在SPARC工作站2上用C语言实现了该算法,并使用MCNC分发的基准测试进行了测试,MCNC的单元放置由TimberWolfSC4.2c生成。实验结果表明,与传统路由算法相比,新路由算法的信道高度降低了约13.1%。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Conditional and unconditional hardware sharing in pipeline synthesis Partitioning strategies within a distributed multilevel logic simulator including dynamic repartitioning Extended 0/1 LP formulation for the scheduling problem in high-level synthesis The CALLAS synthesis system and its application to mechatronic ASIC design problems Realizing expression graphs using table-lookup FPGAs
×
引用
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