Hierarchical placement and floorplanning in BEAR

Hierarchical placement and floorplanning algorithms for rectangular blocks are described and implemented as part of the BEAR building block layout system developed at the University of California at Berkeley. The algorithm combines the goal orientation of top-down approaches with the block orientation of bottom-up techniques. The result is a meet-in-the-middle strategy. It considers the mutual dependency between placement and routing explicitly by incorporating a novel method of hierarchical routing area estimation. If the layout includes flexible blocks, the placement result can be further optimized by resizing these blocks subject to constraints on their areas and aspect ratios. Placement and floorplanning are refined more and more (with possible topological change) as routing proceeds. Global routing is updated incrementally to eliminate the need for iterations between placement and routing, thus achieving a more uniform design flow. >

[1]  William R. Heller,et al.  Prediction of wiring space requirements for LSI , 1977, DAC '77.

[2]  A min-cut placement algorithm for general cell assemblies based on a graph representation , 1979, DAC '79.

[3]  Abbas El Gamal,et al.  A stochastic model for interconnections in custom integrated circuits , 1981 .

[4]  William R. Heller,et al.  On finding Most Optimal Rectangular Package Plans , 1982, DAC 1982.

[5]  Chak-Kuen Wong,et al.  An algorithm for optimal two-dimensional compaction of VLSI layouts , 1983, Integr..

[6]  Larry J. Stockmeyer,et al.  Optimal Orientations of Cells in Slicing Floorplan Designs , 1984, Inf. Control..

[7]  Ikuo Harada,et al.  CHAMP: Chip Floor Plan for Hierarchical VLSI Layout Design , 1985, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

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

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

[10]  Bryan T. Preas,et al.  Automatic Placement A Review of Current Techniques , 1986, DAC 1986.

[11]  Fadi J. Kurdahi,et al.  PLEST: A Program for Area Estimation of VLSI Integrated Circuits , 1986, 23rd ACM/IEEE Design Automation Conference.

[12]  Bryan Preas,et al.  Automatic Placement A Review of Current Techniques , 1986, 23rd ACM/IEEE Design Automation Conference.

[13]  C. L. Liu,et al.  A New Algorithm for Floorplan Design , 1986, DAC 1986.

[14]  Antoni A. Szepieniec.  Integrated Placement/Routing in Sliced Layouts , 1986, DAC 1986.

[15]  Ernest S. Kuh,et al.  A Dynamic and Efficient Representation of Building-Block Layout , 1987, 24th ACM/IEEE Design Automation Conference.

[16]  Ernest S. Kuh,et al.  Simultaneous Floor Planning and Global Routing for Hierarchical Building-Block Layout , 1987, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[17]  Alberto L. Sangiovanni-Vincentelli,et al.  A Parallel Simulated Annealing Algorithm for the Placement of Macro-Cells , 1987, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[18]  I. Adler,et al.  On the partitioning of graphs and hypergraphs , 1987 .

[19]  Gerhard Zimmerman,et al.  A new area and shape function estimation technique for VLSI layouts , 1988, 25th ACM/IEEE, Design Automation Conference.Proceedings 1988..

[20]  Xinghao Chen,et al.  A module area estimator for VLSI layout , 1988, 25th ACM/IEEE, Design Automation Conference.Proceedings 1988..

[21]  I. Koren,et al.  Optimal aspect ratios of building blocks in VLSI , 1988, 25th ACM/IEEE, Design Automation Conference.Proceedings 1988..

[22]  Massoud Pedram,et al.  Accurate prediction of physical design characteristics for random logic , 1989, Proceedings 1989 IEEE International Conference on Computer Design: VLSI in Computers and Processors.