LC-KO: A congestion-aware and area&timing-oriented placement method

Since highly congested areas always result in routing detours and short circuits in ASIC & SoC design, the problem of local routing congestion is becoming increasingly rigorous in the place and route procedures. Many related researches laid special stress only on reducing congestions at placement stage or routing stage to short total wire length. Meanwhile, some place optimization constrains are integrated in most existing ARP tools. Although these available methods can alleviate congestion in some extent, they produce negative influence on the area and timing of whole chips. In this paper, a congestion-aware and area&timing oriented placement method which is called LC-KO is proposed. The LC-KO method focuses on reducing the local routing congestion with the purpose of optimizing area and timing. This method is composed of three stages: firstly, find the specific local congestion region which is called SLC-region in this paper; Secondly, find the specific HPC representing the cell with high pin number in this paper around which keep-out regions should be added; third, calculate the keep-out value. Experimental results show that compared with the ICC congestion constrains, the LC-KO method can reduce the shorts and improve the timing significantly, but with a lower runtime.

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

[2]  Hongxia Zhou,et al.  Congestion-oriented approach in placement for analog and mixed-signal circuits , 2013, Fifth Asia Symposium on Quality Electronic Design (ASQED 2013).

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

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

[5]  Qiang Zhou,et al.  Congestion-Driven Placement Improvement Using Cell Spreading , 2006, 2006 International Conference on Communications, Circuits and Systems.

[6]  Yanheng Zhang,et al.  CROP: Fast and effective congestion refinement of placement , 2009, 2009 IEEE/ACM International Conference on Computer-Aided Design - Digest of Technical Papers.

[7]  Ankit Goyal Evaluating macro placement in an SoC block based on a congestion estimate , 2012, 2012 25th IEEE Canadian Conference on Electrical and Computer Engineering (CCECE).

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

[9]  Qiang Zhou,et al.  Congestion driven incremental placement algorithm based on network flow , 2005, Proceedings. 2005 International Conference on Communications, Circuits and Systems, 2005..

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

[11]  Taraneh Taghavi,et al.  New placement prediction and mitigation techniques for local routing congestion , 2010, 2010 IEEE/ACM International Conference on Computer-Aided Design (ICCAD).