On the behavior of congestion minimization during placement

Typical placement objectives involve reducing net-cut cost or minimizing wirelength. Congestion minimization is least understood, however, it models routability accurately. In this paper, we study the congestion minimization problem during placement. We introduce the notion of consistent routing model and promote its adoption by placement systems. First, we show that in this model the wirelength objective is indeed a good measure of congestion by establishing that a placement with minimum wirelength has minimum total congestion. We show that minimizing wirelength may (and in general, will) create locally congested regions. We demonstrate that most other congestion related objectives are ill behaved and they should only be used in a post processing step. We then propose several novel congestion minimization objectives. One in particular, called over ow minimization with look-ahead, performs very well and can be computed very e ciently in an incremental manner. At the end, we propose a post processing phase that further improves the congestion. By combining the over ow minimization with look-ahead and the post processing phase, we improve the congestion by more than 40% on the average.

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

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

[3]  J. Cong,et al.  Multiway partitioning with pairwise movement , 1998, ICCAD '98.

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

[5]  Pinaki Mazumder,et al.  VLSI cell placement techniques , 1991, CSUR.

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

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

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

[9]  Majid Sarrafzadeh,et al.  NRG: global and detailed placement , 1997, ICCAD 1997.

[10]  Georg Sigl,et al.  GORDIAN: VLSI placement by quadratic programming and slicing optimization , 1991, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..