An effective congestion-driven placement framework

We present a fast but reliable way to detect routing criticalities in very large scale integration chips. In addition, we show how this congestion estimation can be incorporated into a partitioning based placement algorithm. Different to previous approaches, we do not rerun parts of the placement algorithm or apply a postplacement optimization, but we use our congestion estimator for a dynamic avoidance of routability problems in one single run of the placement algorithm. Computational experiments on chips with up to 1300000 cells are presented. The framework reduces the usage of the most critical routing edges by 9.0% on average, the running time increase for the placement is about 8.7%. However, due to the smaller congestion, the running time of routing tools can be decreased drastically, so the total time for placement and (global) routing is decreased by 47% on average.

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

[2]  Ulrich Lauther,et al.  Congestion-driven placement using a new multi-partitioning heuristic , 1990, 1990 IEEE International Conference on Computer-Aided Design. Digest of Technical Papers.

[3]  Michael J. Flynn,et al.  Stochastic Congestion Model for VLSI Systems , 1997 .

[4]  Sadiq M. Sait,et al.  Vlsi physical design automation , 1995 .

[5]  Majid Sarrafzadeh,et al.  Congestion reduction during placement based on integer programming , 2001, IEEE/ACM International Conference on Computer Aided Design. ICCAD 2001. IEEE/ACM Digest of Technical Papers (Cat. No.01CH37281).

[6]  Christoph Albrecht,et al.  Global routing by new approximation algorithms for multicommodityflow , 2001, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[7]  Majid Sarrafzadeh,et al.  Congestion estimation during top-down placement , 2001, ISPD '01.

[8]  Majid Sarrafzadeh,et al.  An Introduction To VLSI Physical Design , 1996 .

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

[10]  D. F. Wong,et al.  Simulated Annealing for VLSI Design , 1988 .

[11]  Naveed A. Sherwani,et al.  Algorithms for VLSI Physical Design Automation , 1999, Springer US.

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

[13]  Majid Sarrafzadeh,et al.  Congestion reduction during placement with provably good approximation bound , 2003, TODE.

[14]  Majid Sarrafzadeh,et al.  On the behavior of congestion minimization during placement , 1999, ISPD '99.

[15]  Andrew B. Kahng,et al.  Partitioning-based standard-cell global placement with an exact objective , 1997, ISPD '97.

[16]  Carl Sechen,et al.  VLSI Placement and Global Routing Using Simulated Annealing , 1988 .

[17]  Jens Vygen,et al.  Algorithms for large-scale flat placement , 1997, DAC.

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

[19]  Majid Sarrafzadeh,et al.  Multi-center congestion estimation and minimization during placement , 2000, ISPD '00.

[20]  Andrew B. Kahng,et al.  Can recursive bisection alone produce routable, placements? , 2000, Proceedings 37th Design Automation Conference.

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

[22]  Sadiq M. Sait,et al.  VLSI Physical Design Automation - Theory and Practice , 1995, Lecture Notes Series on Computing.

[23]  Richard B. Brown,et al.  Congestion driven quadratic placement , 1998, Proceedings 1998 Design and Automation Conference. 35th DAC. (Cat. No.98CH36175).

[24]  Majid Sarrafzadeh,et al.  Dragon2000: standard-cell placement tool for large industry circuits , 2000, IEEE/ACM International Conference on Computer Aided Design. ICCAD - 2000. IEEE/ACM Digest of Technical Papers (Cat. No.00CH37140).

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