Congestion-Driven Placement Improvement Using Cell Spreading

As technology moves into VDSM arena, the integration density of ICs goes higher and higher. It makes the congestion a global issue, for it appears in many pieces on the chip while not only in some bins. Many methods proposed before just focused on reducing the congestion restrictedly in one bin, but can not handle the problem of global congestion effectively. In this paper, a congestion-driven placement method using cell spreading is proposed, which alters the routing supply and the routing demand by row or column uniformly. During the spreading process, cells move along the direction in which the congestion is cut down. The average routing demands are set to control the extent for cell spreading to avoid producing new congestion. The experiments show that our method can reduce the congestion by 31.4% in x direction and 22.1% in y direction on average while within 5% wire length being increased

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

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

[3]  Zhen Yang,et al.  Congestion driven placement for VLSI standard cell design , 2003, Proceedings of the 12th IEEE International Conference on Fuzzy Systems (Cat. No.03CH37442).

[4]  Joseph R. Shinnerl,et al.  Large-Scale Circuit Placement: Gap and Promise , 2003, ICCAD 2003.

[5]  David Z. Pan,et al.  Diffusion-based placement migration , 2005, Proceedings. 42nd Design Automation Conference, 2005..

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

[7]  Zhuoyuan Li,et al.  Congestion driven incremental placement algorithm for standard cell layout , 2003, Proceedings of the ASP-DAC Asia and South Pacific Design Automation Conference, 2003..

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

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

[10]  Jason Cong,et al.  Routability-driven placement and white space allocation , 2004, IEEE/ACM International Conference on Computer Aided Design, 2004. ICCAD-2004..

[11]  Jason Cong,et al.  Physical hierarchy generation with routing congestion control , 2002, ISPD '02.

[12]  Chih-Liang Eric Cheng.  RISA: accurate and efficient placement routability modeling , 1994, ICCAD.

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

[14]  Youssef Saab,et al.  A Fast Clustering-Based Min-Cut Placement Algorithm With Simulated-Annealing Performance , 1996, VLSI Design.

[15]  Chris C. N. Chu,et al.  FastPlace: efficient analytical placement using cell shifting, iterative local refinement, and a hybrid net model , 2005, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[16]  Ren-Song Tsay,et al.  Early wirability checking and 2D congestion-driven circuit placement , 1992, [1992] Proceedings. Fifth Annual IEEE International ASIC Conference and Exhibit.

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

[18]  Ulrich Brenner,et al.  An effective congestion driven placement framework , 2002, ISPD '02.

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

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

[21]  Majid Sarrafzadeh,et al.  Routability driven white space allocation for fixed-die standard-cell placement , 2002, ISPD '02.

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