https://scholars.lib.ntu.edu.tw/handle/123456789/341027
標題: | Multi-layer global routing considering via and wire capacities | 作者: | Hsu, C.-H. Chen, H.-Y. YAO-WEN CHANG |
公開日期: | 2008 | 起(迄)頁: | 350-355 | 來源出版物: | IEEE/ACM International Conference on Computer-Aided Design | 摘要: | Global routing for modern large-scale circuit designs has attracted much attention in the recent literature. Most of the state-of-the-art academic global routers just work on a simplified routing congestion model that ignores the essential via capacity for routing through multiple metal layers. Such a simplified model would easily cause fatal routability problems in subsequent detailed routing. To remedy this deficiency, we present in this paper a more effective congestion metric that considers both the in-tile nets and the residual via capacity for global routing. With this congestion metric, we develop a new global router that features two novel routing algorithms for congestion optimization, namely least-flexibility-first routing and multi-source multi-sink escaping-point routing. The least-flexibility-first routing processes the nets with the least flexibility first, facilitating a quick prediction of congestion hot spots for the subsequent nets. Enjoying lower time complexity than traditional maze and A*-search routing, in particular, the linear-time escaping-point routing guarantees to find the optimal solution and achieves the theoretical lower-bound time complexity. Experimental results show that our global router can achieve very high-quality routing solutions with more reasonable via usage, which can benefit and correctly guide subsequent detailed routing. |
URI: | http://www.scopus.com/inward/record.url?eid=2-s2.0-57849135023&partnerID=MN8TOARS http://scholars.lib.ntu.edu.tw/handle/123456789/341027 |
ISSN: | 10923152 | DOI: | 10.1109/ICCAD.2008.4681597 | SDG/關鍵字: | Computer aided design; Global optimization; Marine biology; Routers; Circuit designs; Detailed routing; Global routers; Global routing; Hot spots; Multiple metals; Optimal solutions; Routability; Routing congestions; Routing processes; Simplified models; Time complexities; Routing algorithms |
顯示於: | 電子工程學研究所 |
在 IR 系統中的文件,除了特別指名其著作權條款之外,均受到著作權保護,並且保留所有的權利。