A fast maze-free routing congestion estimator with hybrid unilateral monotonic routing

Wen Hao Liu*, Yih-Lang Li, Cheng Kok Koh

*此作品的通信作者

研究成果: Conference article同行評審

33 引文 斯高帕斯(Scopus)

摘要

Considering routability issue in the early stages of VLSI design flow can avoid generating an unroutable design. Several recent routablity-driven placers [8-11] adopt a built-in global router to estimate routing congestion. While the routability of the placement solution improves, the performance of these placers degrades. Many of these built-in global router and state-of-the-art academic global routers use maze routing to seek a detoured path. Although very effective, maze routing is relatively slower than other routing algorithms, such as pattern routing and monotonic routing algorithms. This work presents two efficient routing algorithms, called unilateral monotonic routing and hybrid unilateral monotonic routing, to replace maze routing and to realize a highly fast maze-free global router that is suited to act as a built-in routing congestion estimator for placers. Experimental results indicate that RCE achieves similar routing quality when compared with [20], as well as an over 20-fold runtime speedup in large benchmarks.

原文English
文章編號6386752
頁(從 - 到)713-719
頁數7
期刊IEEE/ACM International Conference on Computer-Aided Design, Digest of Technical Papers, ICCAD
DOIs
出版狀態Published - 2012
事件2012 30th IEEE/ACM International Conference on Computer-Aided Design, ICCAD 2012 - San Jose, CA, United States
持續時間: 5 11月 20128 11月 2012

指紋

深入研究「A fast maze-free routing congestion estimator with hybrid unilateral monotonic routing」主題。共同形成了獨特的指紋。

引用此