{"title":"A heuristic global router for polycell layout","authors":"V. K. De, K. Kozminski, G. Kedem","doi":"10.1109/CICC.1988.20846","DOIUrl":null,"url":null,"abstract":"A novel heuristic global routing algorithm has been developed and implemented. The advantage of using heuristics for routing is that they can achieve a close-to-optimal solution in a reasonable amount of computation time. It is shown that in most cases the router achieves as good or better layout area and total wirelength as the TimberWolf global router which uses the inherently time-expensive technique of simulated annealing. It is concluded by using good heuristics that the potentially computation-intensive problem of optimal global routing can be solved efficiently without trading off a significant amount of optimality.<<ETX>>","PeriodicalId":313270,"journal":{"name":"Proceedings of the IEEE 1988 Custom Integrated Circuits Conference","volume":"64 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1988-05-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the IEEE 1988 Custom Integrated Circuits Conference","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CICC.1988.20846","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3
Abstract
A novel heuristic global routing algorithm has been developed and implemented. The advantage of using heuristics for routing is that they can achieve a close-to-optimal solution in a reasonable amount of computation time. It is shown that in most cases the router achieves as good or better layout area and total wirelength as the TimberWolf global router which uses the inherently time-expensive technique of simulated annealing. It is concluded by using good heuristics that the potentially computation-intensive problem of optimal global routing can be solved efficiently without trading off a significant amount of optimality.<>
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
