A research on optimum-searching quadratic optimization for very large-scale standard cell placement

This paper presents a research on how to find the optimal or near optimal solution in the specific standard cell placement of very large-scale integration (VLSI) designs. The optimization methods currently used are faced with big difficulties in finding better placement result. This paper studies the quadratic optimization that is frequently adopted in this field and analyzes the difficulty it faces. Meanwhile, this paper suggests a very efficient quadratic programming based optimization method. This method employs the tactic of hybrid search based on multi-space search and search space traversing to try to find the optimum or near-optimum of the problem. Experimental results show that this method can make up with the shortcomings of the current quadratic optimization used in placement to a far extent and gains much placement improvement.

[1]  Yici Cai,et al.  Corner block list representation and its application to floorplan optimization , 2004, IEEE Transactions on Circuits and Systems II: Express Briefs.

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

[3]  Sadiq M. Sait,et al.  Vlsi physical design automation , 1995 .

[4]  Hugo De Man,et al.  Search space reduction through clustering in test generation , 1995, Proceedings of EURO-DAC. European Design Automation Conference.

[5]  Hong Yu,et al.  CASH: a novel quadratic placement algorithm for very large standard cell layout design based on clustering , 1998, 1998 5th International Conference on Solid-State and Integrated Circuit Technology. Proceedings (Cat. No.98EX105).

[6]  Yongqiang Lyu,et al.  Combining clustering and partitioning in quadratic placement , 2003, Proceedings of the 2003 International Symposium on Circuits and Systems, 2003. ISCAS '03..

[7]  Kamal Chaudhary,et al.  RITUAL: a performance driven placement algorithm , 1992 .

[8]  G. Karypis,et al.  Multilevel k-way hypergraph partitioning , 1999, Proceedings 1999 Design Automation Conference (Cat. No. 99CH36361).

[9]  D. Smith,et al.  A Search Space Toolkit , 1995, Proceedings the 11th Conference on Artificial Intelligence for Applications.