Efficient simulated evolution based rerouting and congestion-relaxed layer assignment on 3-D global routing

Ke Ren Dai*, Wen Hao Liu, Yih-Lang Li

*此作品的通信作者

研究成果: Conference contribution同行評審

24 引文 斯高帕斯(Scopus)

摘要

The increasing complexity of interconnection designs has enhanced the importance of research into global routing when seeking high-routability (low overflow) results or rapid search paths that report wire-length estimations to a placer. This work presents two routing techniques, namely adaptive pseudorandom net-ordering routing and evolution-based rip-up and reroute using a two-stage cost function in a high-performance congestion-driven 2-D global router. We also propose two efficient via-minimization methods, namely congestion relaxation by layer shifting and rip-up and re-assignment, for a dynamic programming-based layer assignment. Experimental results demonstrate that our router achieves performance similar to the first two winning routers in ISPD 2008 Routing Contest in terms of both routability and wire length at a 1.42X and 25.84X faster routing speed. Besides, our layer assignment yields 3.5% to 5.6% fewer vias, 2.2% to 3.3% shorter wire-length and 13% to 27% less runtime than COLA.

原文English
主出版物標題Proceedings of the ASP-DAC 2009
主出版物子標題Asia and South Pacific Design Automation Conference 2009
頁面570-575
頁數6
DOIs
出版狀態Published - 20 4月 2009
事件Asia and South Pacific Design Automation Conference 2009, ASP-DAC 2009 - Yokohama, Japan
持續時間: 19 1月 200922 1月 2009

出版系列

名字Proceedings of the Asia and South Pacific Design Automation Conference, ASP-DAC

Conference

ConferenceAsia and South Pacific Design Automation Conference 2009, ASP-DAC 2009
國家/地區Japan
城市Yokohama
期間19/01/0922/01/09

指紋

深入研究「Efficient simulated evolution based rerouting and congestion-relaxed layer assignment on 3-D global routing」主題。共同形成了獨特的指紋。

引用此