An Efficient Tile-Based ECO Router Using Routing Graph Reduction and Enhanced Global Routing Flow

Engineering change order (ECO) routing is frequently requested in the later design stage for the purpose of delay and noise optimization. ECO routing is complicated as a result of huge existing obstacles and the requests for various design rules. The tile-based routing model results in fewer nodes of the routing graph than grid and connection-based routers; however, the number of nodes of the tile-based routing graph has grown to over a billion for system-on-chip designs, while no notable progress has been achieved in the routing speed of the tile-based router since it was proposed. This paper first proposes a novel routing graph reduction (RGR) method for promoting tile propagation speed and then depicts a new ECO routing design flow with RGR and enhanced global routing flow (EGRF). RGR can be used to remove redundant tiles as well as align and merge neighboring tiles in order to diminish tile fragmentation such that the tile-based ECO router can run twice as fast while still producing an optimal path. Compared with a commercial placement and routing tool, the proposed tile-based router with RGR obtains better routing performance and routing quality for three ECO routings. EGRF incorporates ECO global routing considering via-resource congestion metric with extended routing and global cell (GCell) restructuring to prevent routing failure in routable designs. The ECO router with the proposed design flow can perform up to 20 times faster than the original tile-based router at the cost of only a slight decline in routing quality. Experimental results also demonstrate that a more congested layout tends to have higher graph reduction rate. Also discussed herein are further refinements by dynamic weighting of via and wire resources based on the vacancy density of the routed design and further application of RGR to multiple-net routing

[1]  Jeremy Dion,et al.  Contour: a tile-based gridless router , 1995 .

[2]  San Francisco,et al.  28th ACM/IEEE DESIGN AUTOMATION CONFERENCE@ , 1991 .

[3]  D. T. Lee,et al.  A Fast Crosstalk- and Performance-Driven Multilevel Routing System , 2003, ICCAD 2003.

[4]  Jason Cong,et al.  An implicit connection graph maze routing algorithm for ECO routing , 1999, 1999 IEEE/ACM International Conference on Computer-Aided Design. Digest of Technical Papers (Cat. No.99CH37051).

[5]  Jason Cong,et al.  DUNE-a multilayer gridless routing system , 2001, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[6]  Yao-Wen Chang,et al.  MR: a new framework for multilevel full-chip routing , 2004, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[7]  Chak-Kuen Wong,et al.  Rectilinear Shortest Paths and Minimum Spanning Trees in the Presence of Rectilinear Obstacles , 1987, IEEE Transactions on Computers.

[8]  Carl Sechen,et al.  Chip-level area routing , 1998, ISPD '98.

[9]  Kenneth L. Clarkson,et al.  Rectilinear shortest paths through polygonal obstacles in O(n(logn)2) time , 1987, SCG '87.

[10]  Jason Cong,et al.  DUNE: a multi-layer gridless routing system with wire planning , 2000, ISPD '00.

[11]  John K. Ousterhout,et al.  Corner Stitching: A Data-Structuring Technique for VLSI Layout Tools , 1984, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[12]  Chia-Chun Tsai,et al.  An H-V alternating router , 1992, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[13]  Russell Kao,et al.  Shortest path search using tiles and piecewise linear costpropagation , 2002, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[14]  Jason Cong,et al.  Multilevel approach to full-chip gridless routing , 2001, IEEE/ACM International Conference on Computer Aided Design. ICCAD 2001. IEEE/ACM Digest of Technical Papers (Cat. No.01CH37281).

[15]  Alessandro De Gloria,et al.  A Tile-Expansion Router , 1987, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[16]  S. Sitharama Iyengar,et al.  Finding obstacle-avoiding shortest paths using implicit connection graphs , 1996, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[17]  Jason Cong,et al.  An enhanced multilevel routing system , 2002, IEEE/ACM International Conference on Computer Aided Design, 2002. ICCAD 2002..

[18]  R. Eric Lunow.  A channelless, multilayer router , 1988, 25th ACM/IEEE, Design Automation Conference.Proceedings 1988..

[19]  Jason Cong,et al.  Performance optimization of VLSI interconnect layout , 1996, Integr..