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

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

*Corresponding author for this work

Research output: Contribution to journalConference articlepeer-review

25 Scopus citations

Abstract

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.

Original languageEnglish
Article number6386752
Pages (from-to)713-719
Number of pages7
JournalIEEE/ACM International Conference on Computer-Aided Design, Digest of Technical Papers, ICCAD
DOIs
StatePublished - 1 Dec 2012
Event2012 30th IEEE/ACM International Conference on Computer-Aided Design, ICCAD 2012 - San Jose, CA, United States
Duration: 5 Nov 20128 Nov 2012

Fingerprint Dive into the research topics of 'A fast maze-free routing congestion estimator with hybrid unilateral monotonic routing'. Together they form a unique fingerprint.

Cite this