ePlace-MS: Electrostatics-Based Placement for Mixed-Size Circuits

We propose an electrostatics-based placement algorithm for large-scale mixed-size circuits (ePlace-MS). ePlace-MS is generalized, flat, analytic and nonlinear. The density modeling method eDensity is extended to handle the mixed-size placement. We conduct detailed analysis on the correctness of the gradient formulation and the numerical solution, as well as the rationale of dc removal and the advantages over prior density functions. Nesterov's method is used as the nonlinear solver, which shows high yet stable performance over mixed-size circuits. The steplength is set as the inverse of Lipschitz constant of the gradient function, while we develop a backtracking method to prevent overestimation. An approximated nonlinear preconditioner is developed to minimize the topological and physical differences between large macros and standard cells. Besides, we devise a simulated annealer to legalize the layout of macros and use a second-phase global placement to reoptimize the standard cell layout. All the above innovations are integrated into our mixed-size placement prototype ePlace-MS, which outperforms all the related works in literature with better quality and efficiency. Compared to the leading-edge mixed-size placer NTUplace3, ePlace-MS produces up to 22.98% and on average 8.22% shorter wirelength over all the 16 modern mixed-size benchmark circuits with the same runtime.

[1]  Chiu-Wing Sham,et al.  LMgr: A low-M emory global router with dynamic topology update and bending-aware optimum path search , 2013, International Symposium on Quality Electronic Design (ISQED).

[2]  Yao-Wen Chang,et al.  TSV-Aware Analytical Placement for 3-D IC Designs Based on a Novel Weighted-Average Wirelength Model , 2013, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[3]  Yao-Wen Chang,et al.  NTUplace3: An Analytical Placer for Large-Scale Mixed-Size Designs With Preplaced Blocks and Density Constraints , 2008, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[4]  Chung-Kuan Cheng,et al.  ePlace: Electrostatics-Based Placement Using Fast Fourier Transform and Nesterov's Method , 2015, TODE.

[5]  Andrew B. Kahng,et al.  Stability and scalability in global routing , 2011, International Workshop on System Level Interconnect Prediction.

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

[7]  Chung-Kuan Cheng,et al.  ePlace: Electrostatics based placement using Nesterov's method , 2014, 2014 51st ACM/EDAC/IEEE Design Automation Conference (DAC).

[8]  Jarrod A. Roy,et al.  Min-cut floorplacement , 2006, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[9]  Igor L. Markov,et al.  ComPLx: A competitive primal-dual Lagrange optimization for global placement , 2012, DAC Design Automation Conference 2012.

[10]  Chung-Kuan Cheng,et al.  Performance-driven placement for design of rotation and right arithmetic shifters in monolithic 3D ICs , 2013, 2013 International Conference on Communications, Circuits and Systems (ICCCAS).

[11]  Wing-Kai Chow,et al.  Clock Network Synthesis with Concurrent Gate Insertion , 2010, PATMOS.

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

[13]  Y. Nesterov A method for solving the convex programming problem with convergence rate O(1/k^2) , 1983 .

[14]  Yao-Wen Chang,et al.  Unified analytical global placement for large-scale mixed-size circuit designs , 2010, 2010 IEEE/ACM International Conference on Computer-Aided Design (ICCAD).

[15]  Chris C. N. Chu,et al.  FastPlace 3.0: A Fast Multilevel Quadratic Placement Algorithm with Placement Congestion Control , 2007, 2007 Asia and South Pacific Design Automation Conference.

[16]  M. Hestenes,et al.  Methods of conjugate gradients for solving linear systems , 1952 .

[17]  Yao-Wen Chang,et al.  Constraint graph-based macro placement for modern mixed-size circuit designs , 2008, 2008 IEEE/ACM International Conference on Computer-Aided Design.

[18]  J. Shewchuk An Introduction to the Conjugate Gradient Method Without the Agonizing Pain , 1994 .

[19]  Igor L. Markov,et al.  MAPLE: multilevel adaptive placement for mixed-size designs , 2012, ISPD '12.

[20]  Wing-Kai Chow,et al.  A new clock network synthesizer for modern VLSI designs , 2012, Integr..

[21]  Gunilla Sköllermo A Fourier method for the numerical solution of Poisson's equation , 1975 .

[22]  Jingwei Lu,et al.  Fundamental Research on Electronic Design Automation in VLSI Design - Routability , 2010 .

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

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

[25]  Chung-Kuan Cheng,et al.  FFTPL: An analytic placement algorithm using fast fourier transform for density equalization , 2013, 2013 IEEE 10th International Conference on ASIC.

[26]  C. D. Gelatt,et al.  Optimization by Simulated Annealing , 1983, Science.

[27]  David S. Johnson,et al.  Some Simplified NP-Complete Graph Problems , 1976, Theor. Comput. Sci..

[28]  Chris C. N. Chu,et al.  RQL: Global Placement via Relaxed Quadratic Spreading and Linearization , 2007, 2007 44th ACM/IEEE Design Automation Conference.

[29]  Yao-Wen Chang,et al.  MP-Trees: A Packing-Based Macro Placement Algorithm for Modern Mixed-Size Designs , 2008, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[30]  Evangeline F. Y. Young,et al.  Congestion prediction in early stages of physical design , 2009, TODE.

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

[32]  Yoji Kajitani,et al.  VLSI module placement based on rectangle-packing by the sequence-pair , 1996, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[33]  Evangeline F. Y. Young,et al.  A dual-MST approach for clock network synthesis , 2010, 2010 15th Asia and South Pacific Design Automation Conference (ASP-DAC).

[34]  John Darzentas,et al.  Problem Complexity and Method Efficiency in Optimization , 1983 .

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

[36]  Ismail Bustany,et al.  POLAR: Placement based on novel rough legalization and refinement , 2013, 2013 IEEE/ACM International Conference on Computer-Aided Design (ICCAD).

[37]  Andrew B. Kahng,et al.  A faster implementation of APlace , 2006, ISPD '06.

[38]  Chris C. N. Chu,et al.  Handling complexities in modern large-scale mixed-size placement , 2009, 2009 46th ACM/IEEE Design Automation Conference.

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

[40]  Dongjin Lee,et al.  SimPL: An Effective Placement Algorithm , 2010, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[41]  Jin Hu,et al.  Progress and Challenges in VLSI Placement Research , 2012, Proceedings of the IEEE.

[42]  Wing-Kai Chow,et al.  Fast Power- and Slew-Aware Gated Clock Tree Synthesis , 2012, IEEE Transactions on Very Large Scale Integration (VLSI) Systems.

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