Combining clustering and partitioning in quadratic placement

Author

Lu, Yongqiang ; Hong, Xianlong ; Hou, Wenting ; Wu, Weimin ; Cai, Yici

Author_Institution

Dept. of Comput. Sci. & Technol., Tsinghua Univ., Beijing, China

Volume

4

fYear

2003

Abstract

Because of the computation complexity of large circuits, the quadratic placement (Q-Place) cannot solve the placement problem fast enough without any preprocessing. In this paper, a method of combining the MFFC clustering and hMETIS partitioning based quadratic placement algorithm is proposed. Experimental results show it can gain good results but consume long running time. In order to cut down the running time, an improved MFFC clustering method (IMFFC) based Q-place algorithm is proposed in this paper. Comparing with the combining clustering and partitioning based method, it is much fast but with a little increase in total wire length.

Keywords

circuit layout CAD; circuit optimisation; integrated circuit layout; quadratic programming; IMFFC clustering; MFFC clustering; computational complexity; hMETIS partitioning; integrated circuit; quadratic placement algorithm; quadratic programming optimization; Clustering algorithms; Clustering methods; Computer science; Integrated circuit interconnections; Large-scale systems; Logic circuits; Optimization methods; Partitioning algorithms; Quadratic programming; Wire;

fLanguage

English

Publisher

ieee

Conference_Titel

Circuits and Systems, 2003. ISCAS '03. Proceedings of the 2003 International Symposium on

Print_ISBN

0-7803-7761-3

Type

conf

DOI

10.1109/ISCAS.2003.1206251

Filename

1206251