Congestion driven incremental placement algorithm based on network flow

Congestion is an important problem in VLSI physical design. The paper presents a new incremental placement to reduce local routing congestion with a global view. A minimum-cost flow problem is formulated to balance routing requirement globally, and reduce congestion with minimum deviation from input placement. Besides, a similar network flow method is adopted to remove row overflow and a heuristics, called crucial-part-first, is employed to resolve overlaps. Experimental results show that this algorithm can considerably reduce routing congestion with little wire-length sacrifice of initial placement.

[1]  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).

[2]  Jens Vygen Algorithms for detailed placement of standard cells , 1998, Proceedings Design, Automation and Test in Europe.

[3]  Jens Vygen,et al.  Almost optimum placement legalization by minimum cost flow and dynamic programming , 2004, ISPD '04.

[4]  Patrick Groeneveld,et al.  Probabilistic congestion prediction , 2004, ISPD '04.

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

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

[7]  Andrew B. Kahng,et al.  Requirements for models of achievable routing , 2000, ISPD '00.

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

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

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

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

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

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

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

[15]  Jason Cong,et al.  Multilevel global placement with congestion control , 2003, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..