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

Liu, Chih-Hung; Chen, I-Che; Lee, D. T.

doi:10.1145/2228360.2228471

Cited by 7 publications

(4 citation statements)

References 14 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…For ECO routing, the routing path of each ECO net should avoid crossing all pre-placed macros and pre-routed nets, so the OARSMT routing model is adopted and the state-of-theart OARSMT construction algorithm [10] is used to generate the routing topology of each ECO net. In order to further improve the routing quality, several OARSMTs are derived for each ECO net.…”

Section: A Routing Topology Generationmentioning

confidence: 99%

A topology-based ECO routing methodology for mask cost minimization

Bai

2014

2014 19th Asia and South Pacific Design Automation Conference (ASP-DAC)

View full text Add to dashboard Cite

Although several Engineering Change Order (ECO) routers had been proposed to obtain a routing solution based on different design objectives, mask re-spin cost still cannot be effectively reduced because the ECO routing problem is handled in a sequential manner. This paper presents a three-stage ECO routing flow which can simultaneously route all ECO nets while considering routing layer minimization. Experimental results demonstrate that our proposed ECO routing flow can effectively reduce the number of changed masks with only negligible wirelength and via overhead.

show abstract

Section: A Routing Topology Generationmentioning

confidence: 99%

A topology-based ECO routing methodology for mask cost minimization

Bai

2014

2014 19th Asia and South Pacific Design Automation Conference (ASP-DAC)

View full text Add to dashboard Cite

show abstract

“…This step takes O (m lgm) pattern time for DT construction. [11] 2) Obstacleweighted MST construction Kruskal's algorithm is used to build an obstacle weighted minimum spanning tree over the DT. The edge weights is not required to be exact but expected to be correlated to the cost of the final RSMT.…”

Section: ) Delaunay Triangulation On Apseudo Planementioning

confidence: 99%

“…The inefficiency of the algorithms in [3,4] and [6] results from quadratic size of a routing graph and inefficiency of the algorithm in [10] results from their backtracking procedure of finding Steiner points. Therefore Chih-Hung Liu [11] has developed a more efficient algorithm for ML-OARSMT problem and the OAPDST problem which behaves like a sub quadratic time algorithm for practical applications. The size of a ML-OARSMT is Ω (n 2 ) which indicates that the multilayer model is very different from its 2d counterpart and thus transforms a multilayer instance into a 3d instance and thus enables to employ computational geometry techniques.…”

Section: )Withobstaclesmentioning

confidence: 99%

“…Lee and Yang [11] proposed an O(n log n)-time algorithm to transform a 2-layer instance with PD constraint into a 1-layer instance without PD constraint.The transformation in [11] and the ML-VG construction is combined to construct preferred direction visibility graph (PD-VG) for an OAPD-ST problem instance I. The OAPD-ST construction takes O(mn 2 log 2 n) time in the worst case and O(n log 2 n) time for practical applications.…”

Section: ) Refinementmentioning

confidence: 99%

See 1 more Smart Citation

Performance Analysis of the Algorithms forthe Construction of Multilayer Obstacle Avoiding Rectilinear Steiner Minimum Tree

Divyaprabha¹,

G.R²

2014

IOSRJEEE

View full text Add to dashboard Cite

Routing is a phase in the physical design of Electronic Circuits. The main aim of routing in VLSI design is to interconnect the cells that have been assigned positions as a solution of the placement problem. The problem of finding Rectilinear SteinerMinimal Tree (RSMT) is one of the fundamental problems in the field of Electronic Design Automation. The obstacle avoiding rectilinear Steiner minimal tree problem becomes more important for modern nanometer IC designs which considers numerous routing obstacles incurred from power networks, pre-routed nets, IP blocks, feature patterns for manufacturability improvement, antenna jumpers for reliability enhancement etc. But at present the Multilayer Obstacle Avoiding Rectilinear SteinerMinimal Tree (ML-OARSMT) has gained much importance for modern nanometer IC designs which considers multilayers for routing, obstacles incurred from power networks etc., and preferred direction for routing layer. A ML-OARSMT connects a set of pins and set of obstacles incurred from IP blocks, power networks, pre-routed nets etc., on routing layers by rectilinear edges within layers and vias between layers such that no tree or via intersect an obstacle and the total cost of the tree is minimized. This paper provides a survey of various multilayer obstacles avoiding rectilinear Steiner minimal tree algorithms proposed and thus there is a need for an algorithm to produce better solution quality (reduced wire length) in less running time.

show abstract