A standard-cell placement algorithm of optimizing multiple objects

Timing and congestion behavior are two important goals in performance-driven standard-cell placement. In this paper, we analyze the relationship between timing and congestion behavior. We introduce a multi-step placement algorithm to optimize the two objects. First, a timing-driven placement step is used to find the global optimal solution. In the second step, the algorithm tries to decrease the maximum congestion while not allowing the timing behavior to deteriorate. We implemented our algorithm and tested it with some real circuits. The results show that the maximum delay decreases more than 30% and the maximum congestion decreases more than 10%.

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

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

[3]  Hong Xian.  A New Timing-Driven Placement Algorithm Based on Table\|Lookup Delay Model\+* , 2000 .

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

[5]  Maogang Wang,et al.  Interaction among cost functions in placement , 1999, ICVC '99. 6th International Conference on VLSI and CAD (Cat. No.99EX361).

[6]  Majid Sarrafzadeh,et al.  A delay budgeting algorithm ensuring maximum flexibility in placement , 1997, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..