An-OARSMan: obstacle-avoiding routing tree construction with good length performance

Authors:
Yu Hu;Tong Jing;Xianlong Hong;Zhe Feng;Xiaodong Hu;Guiying Yan
Affiliations:
Tsinghua University, Beijing, P. R. China;Tsinghua University, Beijing, P. R. China;Tsinghua University, Beijing, P. R. China;Tsinghua University, Beijing, P. R. China;Chinese Academy of Sciences, Beijing, P. R. China;Chinese Academy of Sciences, Beijing, P. R. China
Venue:
Proceedings of the 2005 Asia and South Pacific Design Automation Conference
Year:
2005

Citing 6
Cited 12

Rectilinear Shortest Paths and Minimum Spanning Trees in the Presence of Rectilinear Obstacles

IEEE Transactions on Computers
An Ant Colony Approach For The Steiner Tree Problem

GECCO '02 Proceedings of the Genetic and Evolutionary Computation Conference
Fast maze router

DAC '78 Proceedings of the 15th Design Automation Conference
A solution to line-routing problems on the continuous plane

DAC '69 Proceedings of the 6th annual Design Automation Conference
Ant system: optimization by a colony of cooperating agents

IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
Finding obstacle-avoiding shortest paths using implicit connection graphs

IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems

CDCTree: novel obstacle-avoiding routing tree construction based on current driven circuit model

ASP-DAC '06 Proceedings of the 2006 Asia and South Pacific Design Automation Conference
An O(nlogn) algorithm for obstacle-avoiding routing tree construction in the λ-geometry plane

Proceedings of the 2006 international symposium on Physical design
Circuit simulation based obstacle-aware Steiner routing

Proceedings of the 43rd annual Design Automation Conference
Efficient obstacle-avoiding rectilinear steiner tree construction

Proceedings of the 2007 international symposium on Physical design
Circuit-simulated obstacle-aware Steiner routing

ACM Transactions on Design Automation of Electronic Systems (TODAES)
A full-scale solution to the rectilinear obstacle-avoiding Steiner problem

Integration, the VLSI Journal
A multi-layer obstacles-avoiding router using X-architecture

WSEAS Transactions on Circuits and Systems
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)
Generation of optimal obstacle-avoiding rectilinear Steiner minimum tree

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
Obstacle-avoiding rectilinear Steiner tree construction in sequential and parallel approach

Integration, the VLSI Journal

Quantified Score

Hi-index	0.00

Visualization

Abstract

Routing is one of the important steps in VLSI/ULSI physical design. The rectilinear Steiner minimum tree (RSMT) construction is an essential part of routing. Since macro cells, IP blocks, and pre-routed nets are often regarded as obstacles in the routing phase, obstacle-avoiding RSMT (OARSMT) algorithms are useful for practical routing applications. This paper focuses on the OARSMT problem and presents an algorithm, named An-OARSMan, based on ant colony optimization. A greedy obstacle penalty distance (OP-distance) local heuristic is used in the algorithm and performed on the track graph. The algorithm has been implemented and tested on different kinds of obstacles. Experimental results show that An-OARSMan can handle complex obstacle cases including both convex and concave polygon obstacles with good length performance. It can always achieve the optimal solution in the cases with no more than 7 terminals.