MMP: a novel placement algorithm for combined macro block and standard cell layout design

In this paper, an efficient mixed-mode placement algorithm called MMP is presented for the high performance mixed block and standard cell designs. Our approach combines the well-known quadratic placement with bottom-up clustering, as well as the slicing partitioning strategy. This approach can account for macro blocks and standard cells simultaneously. Our method is both very efficient and effective, while it can be run very fast, too. We have tested our algorithm on a set of sample circuits from industry and consistently obtained excellent results.

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

[2]  C. D. Gelatt,et al.  Optimization by Simulated Annealing , 1983, Science.

[3]  Naveed A. Sherwani,et al.  Floorplanning for mixed macro block and standard cell designs , 1994, Proceedings of 4th Great Lakes Symposium on VLSI.

[4]  Chung-Kuan Cheng,et al.  Towards efficient hierarchical designs by ratio cut partitioning , 1989, 1989 IEEE International Conference on Computer-Aided Design. Digest of Technical Papers.

[5]  Andrew B. Kahng,et al.  New spectral methods for ratio cut partitioning and clustering , 1991, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[6]  Uri M. Ascher,et al.  Model and solution strategy for placement of rectangular blocks in the Euclidean plane , 1988, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[7]  Robert W. Dutton,et al.  An Analytical Algorithm for Placement of Arbitrarily Sized Rectangular Blocks , 1985, 22nd ACM/IEEE Design Automation Conference.

[8]  Carl Sechen,et al.  Efficient and effective placement for very large circuits , 1993, ICCAD.

[9]  Andrew B. Kahng,et al.  Fast spectral methods for ratio cut partitioning and clustering , 1991, 1991 IEEE International Conference on Computer-Aided Design Digest of Technical Papers.

[10]  Thomas Lengauer,et al.  Combinatorial algorithms for integrated circuit layout , 1990, Applicable theory in computer science.

[11]  Jason Cong,et al.  A Parallel Bottom-up Clustering Algorithm with Applications to Circuit Partitioning in VLSI Design , 1993, 30th ACM/IEEE Design Automation Conference.

[12]  Brian W. Kernighan,et al.  An efficient heuristic procedure for partitioning graphs , 1970, Bell Syst. Tech. J..

[13]  Hong Xianlong,et al.  VEAP: Global optimization based efficient algorithm for VLSI placement , 1997, Proceedings of ASP-DAC '97: Asia and South Pacific Design Automation Conference.

[14]  Chang-Sheng Ying,et al.  An analytical approach to floorplanning for hierarchical building blocks layout [VLSI] , 1989, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[15]  R. M. Mattheyses,et al.  A Linear-Time Heuristic for Improving Network Partitions , 1982, 19th Design Automation Conference.

[16]  Gershon Kedem,et al.  Heuristic algorithms for combined standard cell and macro block layouts , 1990 .

[17]  Wolfgang Fichtner,et al.  An Analytic Optimization Technique for Placement of Macro-Cells , 1989, 26th ACM/IEEE Design Automation Conference.

[18]  A. Sangiovanni-Vincentelli,et al.  The TimberWolf placement and routing package , 1985, IEEE Journal of Solid-State Circuits.