A new global routing algorithm for over-the-cell routing in standard cell layouts

The authors present a new global routing algorithm for over-the-cell routing in standard cell layout, which determines global routes for each net both in channels and on over-the-cell regions. The goal of the algorithm is to minimize the total channel height in the final lyout. The proposed algorithm is implemented in the C language on a SPARC station 2 and tested with the benchmarks distributed from MCNC, whose cell placements were generated with TimberWolfSC4.2c. Experimental results show that the new routing algorithm reduces the channel height by about 13.1% compared to the conventional routing algorithm.<<ETX>>

[1]  Alberto L. Sangiovanni-Vincentelli,et al.  A New Symbolic Channel Router: YACR2 , 1985, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[2]  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.

[3]  Takeshi Yoshimura,et al.  New placement and global routing algorithms for standard cell layouts , 1991, DAC '90.

[4]  Jason Cong,et al.  Over-the-cell channel routing , 1990, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[5]  Jason Cong,et al.  General models and algorithms for over-the-cell routing in standard cell design , 1991, DAC '90.

[6]  Majid Sarrafzadeh,et al.  New algorithm for over-the-cell channel routing using vacant terminals , 1991, 28th ACM/IEEE Design Automation Conference.

[7]  Carl Sechen,et al.  IMPROVED SIMULATED ANNEALING ALGORIHM FOR ROW-BASED PLACEMENT. , 1987 .

[8]  Jason Cong,et al.  A new algorithm for standard cell global routing , 1992, Integr..