Multilayer Obstacle-Avoiding Rectilinear Steiner Tree Construction Based on Spanning Graphs

Lin, Chung-Wei; Huang, Shih-Lun; Hsu, Kuang–Yu; Lee, Meng-Xiang; Chang, Yao-Wen

doi:10.1109/tcad.2008.2006095

Cited by 23 publications

(42 citation statements)

References 14 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Totally 10 testcases are generated based on [30]. The number of terminals ranges from 25 to 1000, the number of obstacles ranges from 6 to 100 and the number of layers ranges from 5 to 10.…”

Section: Resultsmentioning

confidence: 99%

WiT: Optimal Wiring Topology for Electromigration Avoidance

Jiang

Chang

2012

IEEE Trans. VLSI Syst.

View full text Add to dashboard Cite

Abstract-Due to excessive current densities, electromigration (EM) may trigger a permanent open-or short-circuit failure in signal wires or power networks in analog or mixed-signal circuits. As the feature size keeps shrinking, this effect becomes a key reliability concern. Hence, in this paper, we focus on wiring topology generation for avoiding EM at the routing stage. Prior works tended towards heuristics; on the contrary, we first claim this problem belongs to class P instead of class NP-hard. Our breakthrough is, via the proof of the greedy-choice property, we successfully model this problem on a multi-source multi-sink flow network and then solve it by a strongly polynomial time algorithm. Experimental results prove the effectiveness and efficiency of our algorithm.

show abstract

Section: Resultsmentioning

confidence: 99%

WiT: Optimal Wiring Topology for Electromigration Avoidance

Jiang

Chang

2012

IEEE Trans. VLSI Syst.

View full text Add to dashboard Cite

show abstract

“…According to the experimental results in [9], [10], and [11], those algorithms still behave like a quadratic-time algorithm in practice. In our opinion, the inefficiency of the algorithms in [9] and [10] results from the quadratic size of a routing graph, and the inefficiency of the algorithm in [11] results from their backtracking procedure of finding Steiner points.…”

Section: Introductionmentioning

confidence: 94%

“…In our opinion, the inefficiency of the algorithms in [9] and [10] results from the quadratic size of a routing graph, and the inefficiency of the algorithm in [11] results from their backtracking procedure of finding Steiner points. Since the Steiner tree construction will be invoked many times during the physical design automation, it is necessary to develop a more efficient algorithm for the ML-OARSMT problem and the OAPD-ST problem which behaves like a subquadratic-time algorithm for practical applications.…”

Section: Introductionmentioning

confidence: 95%

“…Compared with [9], our algorithm for the ML-OARSMT problem improves the solution quality in terms of total cost by 2.95% on average, and also achieves 46.12 times speed-up on average at the same time. Compared with [10], our algorithm for the OAPD-ST problem improves the solution quality in terms of total cost by 5.55% on average, and also achieves 16.61 times speed-up on average at the same time.…”

Section: Introductionmentioning

confidence: 99%

“…Therefore, Lin et al [9] first formulated the multilayer OARSMT (ML-OARSMT) problem and discussed the difficulty of extending the methods for the OARSMT problem to the ML-OARSMT problem. They extended the spanning graph in [1] to construct a multi-layer spanning graph and developed an effective algorithm.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

An efficient algorithm for multi-layer obstacle-avoiding rectilinear Steiner tree construction

Liu

Chen

Lee

2012

Proceedings of the 49th Annual Design Automation Conference

View full text Add to dashboard Cite

We consider the multi-layer obstacle-avoiding rectilinear Steiner minimal tree (OARSMT) problem and propose a reduction to transform a multi-layer instance into a 3D instance. Based on the reduction we apply computational geometry techniques to develop an efficient algorithm, utilizing existing OARSMT heuristics. Experimental results show that our algorithm provides a solution with excellent quality and has a significant speed-up compared to previously known results.

show abstract

Finding Shortest Isothetic Path Inside a 3D Digital Object

Kundu

Biswas

2017

Computational Modeling of Objects Presented in Images. Fundamentals, Methods, and Applications

View full text Add to dashboard Cite

Multilayer Obstacle-Avoiding Rectilinear Steiner Tree Construction Based on Spanning Graphs

Cited by 23 publications

References 14 publications

WiT: Optimal Wiring Topology for Electromigration Avoidance

WiT: Optimal Wiring Topology for Electromigration Avoidance

An efficient algorithm for multi-layer obstacle-avoiding rectilinear Steiner tree construction

Finding Shortest Isothetic Path Inside a 3D Digital Object

Contact Info

Product

Resources

About