Highly Efficient Gradient Computation for Density-Constrained Analytical Placement

Recent analytical global placers use density constraints to approximate nonoverlap constraints, and these show very successful results. This paper unifies a wide range of density smoothing techniques called global smoothing and presents a highly efficient method for computing the gradient of such smoothed densities used in several well-known analytical placers. This method reduces the complexity of the gradient computation by a factor of n compared with a naive method, where n is the number of modules. Furthermore, with this efficient gradient computation, it is able to support an efficient nonlinear programming-based placement framework, which supersedes the existing force-directed placement methods. Experiments show that replacing the approximated gradient computation in mPL6 with the exact gradient computation improves wire length by 15% on the IBM-HB+ benchmark and by 3% on average on the modified International Symposium on Physical Design 2005 (ISPD'05) and ISPD'06 placement contest benchmarks with movable macros. The results also show that the augmented Lagrangian method outperforms the quadratic penalty method with the exact gradient computation.

[1]  Jason Cong,et al.  A robust detailed placement for mixed-size IC designs , 2006, Asia and South Pacific Conference on Design Automation, 2006..

[2]  A. Polyanin Handbook of Linear Partial Differential Equations for Engineers and Scientists , 2001 .

[3]  D. Luenberger Optimization by Vector Space Methods , 1968 .

[4]  Tung-Chieh Chen,et al.  A High-Quality Mixed-Size Analytical Placer Considering Preplaced Blocks and Density Constraints , 2006, 2006 IEEE/ACM International Conference on Computer Aided Design.

[5]  Joseph R. Shinnerl,et al.  mPL6: Enhanced Multilevel Mixed-Size Placement with Congestion Control , 2007, Modern Circuit Placement.

[6]  Gi-Joon Nam,et al.  The ISPD2005 placement contest and benchmark suite , 2005, ISPD '05.

[7]  Andrei D. Polyanin,et al.  Polyanin, A. D. and Zaitsev, V. F., Handbook of Nonlinear Partial Differential Equations , Chapman & Hall/CRC, Boca , 2004 .

[8]  Frank M. Johannes,et al.  Generic global placement and floorplanning , 1998, Proceedings 1998 Design and Automation Conference. 35th DAC. (Cat. No.98CH36175).

[9]  Jason Cong,et al.  Multilevel generalized force-directed method for circuit placement , 2005, ISPD '05.

[10]  Andrew B. Kahng,et al.  Architecture and details of a high quality, large-scale analytical placer , 2005, ICCAD-2005. IEEE/ACM International Conference on Computer-Aided Design, 2005..

[11]  Gi-Joon Nam,et al.  ISPD 2006 Placement Contest: Benchmark Suite and Results , 2006, ISPD '06.

[12]  Gerald B. Folland,et al.  Real Analysis: Modern Techniques and Their Applications , 1984 .

[13]  W. Rudin Principles of mathematical analysis , 1964 .

[14]  D K Smith,et al.  Numerical Optimization , 2001, J. Oper. Res. Soc..

[15]  Jarrod A. Roy,et al.  Unification of partitioning, placement and floorplanning , 2004, ICCAD 2004.

[16]  Joseph R. Shinnerl,et al.  mPL6: enhanced multilevel mixed-size placement , 2006, ISPD '06.

[17]  Igor L. Markov,et al.  Solving hard instances of floorplacement , 2006, ISPD '06.

[18]  Ulf Schlichtmann,et al.  Kraftwerk2—A Fast Force-Directed Quadratic Placement Approach Using an Accurate Net Model , 2008, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[19]  P. Spindler,et al.  Fast and Robust Quadratic Placement Combined with an Exact Linear Net Model , 2006, 2006 IEEE/ACM International Conference on Computer Aided Design.