Guiding global placement with wire density

This paper presents an efficient technique for the estimation of the routed wirelength during global placement using the wire density of the net. The proposed method identifies congested regions of the chip and incorporates the model of the routed wirelength into the objective function in order to effectively alleviate these regions from congestion. The method is integrated in the analytical placement framework and the two-level structure improves the scalability of the placer and speeds up the algorithm. The proposed analytical placer provides the best-so-far average routed wirelength in the IBM version2 benchmark suite.

[1]  Majid Sarrafzadeh,et al.  Congestion estimation during top-down placement , 2002, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[2]  Peter Spindler,et al.  Fast and accurate routing demand estimation for efficient routability-driven placement , 2007 .

[3]  Shashi Shekhar,et al.  Multilevel hypergraph partitioning: applications in VLSI domain , 1999, IEEE Trans. Very Large Scale Integr. Syst..

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

[5]  Chih-Liang Eric Cheng,et al.  Risa: Accurate And Efficient Placement Routability Modeling , 1994, IEEE/ACM International Conference on Computer-Aided Design.

[6]  Jarrod A. Roy,et al.  Seeing the Forest and the Trees: Steiner Wirelength Optimization in Placement , 2007, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[7]  Yici Cai,et al.  A new congestion-driven placement algorithm based on cell inflation , 2001, ASP-DAC '01.

[8]  Maogang Wang,et al.  Modeling and minimization of routing congestion , 2000, Proceedings 2000. Design Automation Conference. (IEEE Cat. No.00CH37106).

[9]  Vipin Kumar,et al.  Multilevel k-way Hypergraph Partitioning , 2000, VLSI Design.

[10]  Zhuoyuan Li,et al.  Congestion driven incremental placement algorithm for standard cell layout , 2003, ASP-DAC '03.

[11]  Majid Sarrafzadeh,et al.  Congestion minimization during placement , 2000, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[12]  J. B. G. Frenk,et al.  Recursive Approximation of the High Dimensional Max Function , 2003, Oper. Res. Lett..

[13]  Jason Cong,et al.  Routability-driven placement and white space allocation , 2004, ICCAD 2004.

[14]  Cheng-Kok Koh,et al.  Recursive Function Smoothing of Half-Perimeter Wirelength for Analytical Placement , 2007, 8th International Symposium on Quality Electronic Design (ISQED'07).

[15]  Malgorzata Marek-Sadowska,et al.  Congestion minimization during placement without estimation , 2002, ICCAD 2002.

[16]  Andrew B. Kahng,et al.  Implementation and extensibility of an analytic placer , 2005, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[17]  Shankar Krishnamoorthy,et al.  Estimating routing congestion using probabilistic analysis , 2001, ISPD '01.

[18]  Ulrich Brenner,et al.  An effective congestion-driven placement framework , 2003, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[19]  G. Karypis,et al.  Multiobjective hypergraph-partitioning algorithms for cut and maximum subdomain-degree minimization , 2003, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

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

[21]  Joseph R. Shinnerl,et al.  mPL6: a robust multilevel mixed-size placement engine , 2005, ISPD '05.