A new global routing algorithm independent of net ordering

We proposed a new global routing algorithm solving the net ordering problem. The algorithm uses random optimization methods to keep the equality of earlier routed nets and later routed nets in passing congested areas. It can find a solution independent of net ordering in short time. A global router is implemented in this method. Experiments show that the router performs much faster than Matula router while obtaining solutions with approximate quality.

[1]  Robert Clinton Carden,et al.  Microelectronics global routing and feasibility estimation using a multicommodity flow approach , 1991 .

[2]  Malgorzata Marek-Sadowska,et al.  Global Routing for Gate Array , 1984, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[3]  U. Lauther,et al.  A new global router based on a flow model and linear assignment , 1990, 1990 IEEE International Conference on Computer-Aided Design. Digest of Technical Papers.

[4]  Scott Kirkpatrick,et al.  Global Wiring by Simulated Annealing , 1983, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[5]  A. Lu,et al.  New global routing subsystem for CMOS gate arrays , 1994 .

[6]  Alistair I. Mees,et al.  Convergence of an annealing algorithm , 1986, Math. Program..

[7]  Ehl Emile Aarts,et al.  Statistical cooling : a general approach to combinatorial optimization problems , 1985 .

[8]  Ben Ting,et al.  Routing Techniques for Gate Array , 1983, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[9]  Bryan Preas,et al.  A new algorithm for standard cell global routing , 1988, [1988] IEEE International Conference on Computer-Aided Design (ICCAD-89) Digest of Technical Papers.

[10]  Eugene Shragowitz,et al.  A global router based on a multicommodity flow model , 1987, Integr..