A nonlinear programming and local improvement method for standard cell placement

A new VLSI design procedure incorporating an iterative construction and a local improvement method is presented to deal with standard cell placement. This approach uses no partitioning techniques which are common in the placement approaches. Experimental results on benchmarks and other circuits up to 15059 cells indicate that the new approach yields placements that are comparable to those obtained by TimberWolf 5.1 and is 3-5 times faster than TimberWolf 5.1.

[1]  J. P. Blanks.  Near-optimal quadratic-based placement for a class of IC layout problems , 1985, IEEE Circuits and Devices Magazine.

[2]  Alberto L. Sangiovanni-Vincentelli,et al.  TimberWolf3.2: A New Standard Cell Placement and Global Routing Package , 1986, 23rd ACM/IEEE Design Automation Conference.

[3]  Franco P. Preparata.  Advances in computing research, vol. 2: VLSI theory , 1984 .

[4]  Alberto Sangiovanni-Vincentelli,et al.  TimberWolf3.2: A New Standard Cell Placement and Global Routing Package , 1986, DAC 1986.

[5]  Andrew A. Kennings.  Cell placement using constructive and iterative improvement methods , 1997 .

[6]  Konrad Doll,et al.  Analytical placement: a linear or a quadratic objective function? , 1991, 28th ACM/IEEE Design Automation Conference.

[7]  Georg Sigl,et al.  GORDIAN: VLSI placement by quadratic programming and slicing optimization , 1991, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[8]  Jorge Nocedal,et al.  Algorithm 778: L-BFGS-B: Fortran subroutines for large-scale bound-constrained optimization , 1997, TOMS.

[9]  Konrad Doll,et al.  Iterative placement improvement by network flow methods , 1994, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[10]  Krzysztof Kozminski,et al.  Benchmarks for layout synthesis - evolution and current status , 1991, 28th ACM/IEEE Design Automation Conference.

[11]  J. Nocedal,et al.  A Limited Memory Algorithm for Bound Constrained Optimization , 1995, SIAM J. Sci. Comput..

[12]  Pinaki Mazumder,et al.  VLSI cell placement techniques , 1991, CSUR.

[13]  Lawrence T. Pileggi,et al.  Efficient Final Placement Based on Nets-as-points , 1989, 26th ACM/IEEE Design Automation Conference.