Optimal approach on net routing for VLSI physical design based on Tabu-ant colonies modeling

Abstract To get a more efficient program for net routing design in VLSI physical design, a new mixed algorithm is presented by combining ant colonies algorithm and Tabu search algorithm for improving net routing design scheme in VLSI physical design. The models by considering different structure property such as two-terminal, multiple-terminal, multi-layers and gridless net routing are developed with introducing the proper parameters matching which can be obtained by computer experiments. The results show that the new algorithm can avoid the low convergence rate in the initial stage of basic ant colonies system. The efficiency of the Tabu-ant colonies is improved about 16.667%; meantime, the Tabu-ant colonies system can also avoid the local optimal solution effectively. It builds a basis for future work in solving multiple-terminal, multiple-layers and gridless net routing problems with high efficiency.

[1]  R. J. Kuo,et al.  Hybrid ant colony optimization algorithms for mixed discrete-continuous optimization problems , 2012, Appl. Math. Comput..

[2]  Atsushi Takahashi,et al.  A Fast Longer Path Algorithm for Routing Grid with Obstacles Using Biconnectivity Based Length Upper Bound , 2009 .

[3]  Yanheng Zhang,et al.  RegularRoute: An Efficient Detailed Router Applying Regular Routing Patterns , 2013, IEEE Transactions on Very Large Scale Integration (VLSI) Systems.

[4]  Marco Dorigo,et al.  Ant system: optimization by a colony of cooperating agents , 1996, IEEE Trans. Syst. Man Cybern. Part B.

[5]  Alexander Sprintson,et al.  Efficient Rerouting Algorithms for Congestion Mitigation , 2009, 2009 IEEE Computer Society Annual Symposium on VLSI.

[6]  Mehmet Korürek,et al.  A new ECG beat clustering method based on kernelized fuzzy c-means and hybrid ant colony optimization for continuous domains , 2012, Appl. Soft Comput..

[7]  Ping Yang,et al.  A hybrid optimization approach for chip placement of multi-chip module packaging , 2009, Microelectron. J..

[8]  Frank O. Hadlock,et al.  A shortest path algorithm for grid graphs , 1977, Networks.

[9]  Ping Yang,et al.  A high-performance approach on mechanism isomorphism identification based on an adaptive hybrid genetic algorithm for digital intelligent manufacturing , 2009, Engineering with Computers.

[10]  A. Kahng.  A Steiner tree construction for VLSI routing , 1991, IJCNN-91-Seattle International Joint Conference on Neural Networks.

[11]  Ping Yang,et al.  An intelligent multi-layer net routing method based on minimum spanning tree , 2008 .

[12]  Luca Maria Gambardella,et al.  Ant colony system: a cooperative learning approach to the traveling salesman problem , 1997, IEEE Trans. Evol. Comput..

[13]  Mary Jane Irwin,et al.  A Fast and Simple Steiner Routing Heuristic , 1999, Discret. Appl. Math..

[14]  András Recski,et al.  Routing vertex disjoint Steiner-trees in a cubic grid and connections to VLSI , 2007, Discret. Appl. Math..

[15]  András Recski,et al.  Minimax Results and Polynomial Algorithms in VLSI Routing , 1992 .

[16]  Bernd Engels,et al.  New Tabu Search based global optimization methods outline of algorithms and study of efficiency , 2008, J. Comput. Chem..

[17]  Mingjie Lin,et al.  A Low-Power Field-Programmable Gate Array Routing Fabric , 2009, IEEE Transactions on Very Large Scale Integration (VLSI) Systems.

[18]  Tuhina Samanta,et al.  Geometry Independent Wirelength Estimation Method in VLSI Routing , 2013, 2013 26th International Conference on VLSI Design and 2013 12th International Conference on Embedded Systems.

[19]  Jochen A. G. Jess,et al.  General gate array routing using a k-terminal net routing algorithm with failure prediction , 1993, IEEE Trans. Very Large Scale Integr. Syst..

[20]  Azadeh Davoodi,et al.  GRIP: Global Routing via Integer Programming , 2011, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.