A Fast and Stable Algorithm for Obstacle-Avoiding Rectilinear Steiner Minimal Tree Construction

Authors:
Pei-Ci Wu;Jhih-Rong Gao;Ting-Chi Wang
Affiliations:
Department of Computer Science, National Tsing Hua University, Hsinchu, Taiwan. g944310@oz.nthu.edu.;Department of Computer Science, National Tsing Hua University, Hsinchu, Taiwan. g944310@oz.nthu.edu.;Department of Computer Science, National Tsing Hua University, Hsinchu, Taiwan. g944310@oz.nthu.edu.
Venue:
ASP-DAC '07 Proceedings of the 2007 Asia and South Pacific Design Automation Conference
Year:
2007

Citing 0
Cited 16

Efficient multi-layer obstacle-avoiding rectilinear Steiner tree construction

Proceedings of the 2007 IEEE/ACM international conference on Computer-aided design
Efficient multilayer routing based on obstacle-avoiding preferred direction steiner tree

Proceedings of the 2008 international symposium on Physical design
Obstacle-avoiding rectilinear Steiner tree construction

Proceedings of the 2008 IEEE/ACM International Conference on Computer-Aided Design
High-performance obstacle-avoiding rectilinear steiner tree construction

ACM Transactions on Design Automation of Electronic Systems (TODAES)
Timing-driven non-rectangular obstacles-avoiding routing algorithm for the X-architecture

IMCAS'09 Proceedings of the 8th WSEAS international conference on Instrumentation, measurement, circuits and systems
An O(n log n) path-based obstacle-avoiding algorithm for rectilinear Steiner tree construction

Proceedings of the 46th Annual Design Automation Conference
Timing-driven X-architecture routing tree construction among rectangular and non-rectangular obstacles

WSEAS Transactions on Circuits and Systems
Generation of optimal obstacle-avoiding rectilinear Steiner minimum tree

Proceedings of the 2009 International Conference on Computer-Aided Design
Obstacle-avoiding rectilinear Steiner tree construction based on Steiner point selection

Proceedings of the 2009 International Conference on Computer-Aided Design
FOARS: FLUTE based obstacle-avoiding rectilinear steiner tree construction

Proceedings of the 19th international symposium on Physical design
X-architecture obstacles-avoiding routing with ECO consideration

ICC'10 Proceedings of the 14th WSEAS international conference on Circuits
ECO-aware obstacle-avoiding routing tree algorithm

WSEAS Transactions on Circuits and Systems
Efficient multi-layer obstacle-avoiding preferred direction rectilinear Steiner tree construction

Proceedings of the 16th Asia and South Pacific Design Automation Conference
Obstacle-avoiding rectilinear Steiner minimum tree construction: an optimal approach

Proceedings of the International Conference on Computer-Aided Design
An artificial bee colony algorithm approach for routing in VLSI

ICSI'12 Proceedings of the Third international conference on Advances in Swarm Intelligence - Volume Part I
Obstacle-avoiding rectilinear Steiner tree construction in sequential and parallel approach

Integration, the VLSI Journal

Quantified Score

Hi-index	0.00

Visualization

Abstract

In routing, finding a rectilinear Steiner minimal tree (RSMT) is a fundamental problem. Today's design often contains rectilinear obstacles, like macro cells, IP blocks, and pre-routed nets. Therefore obstacle-avoiding RSMT (OARSMT) construction becomes a very practical problem. In this paper we present a fast and stable algorithm for this problem. We use a partitioning based method and an ant colony optimization based method to construct obstacle-avoiding Steiner minimal tree (OASMT). Besides, two heuristics are proposed to do the rectilinearization and refinement to further improve wirelegnth. The experimental results show our algorithm achieves the best wirelength results in most of the test cases and the runtime is very small even for the larger cases each of which has both the number of terminals and the number of obstacles more than 100.