Unification of partitioning, placement and floorplanning

Large macro blocks, pre-designed datapaths, embedded memories and analog blocks are increasingly used in ASIC designs. However, robust algorithms for large-scale placement of such designs have only recently been considered in the literature, and improvements by over 10% per paper are still common. Large macros can be handled by traditional floorplanning, but are harder to account for in min-cut and analytical placement. On the other hand, traditional floorplanning techniques do not scale to large numbers of objects, especially in terms of solution quality. We propose to integrate min-cut placement with fixed-outline floor-planning to solve the more general placement problem, which includes cell placement, floorplanning, mixed-size placement and achieving routability. At every step of min-cut placement, either partitioning or wirelength-driven, fixed-outline floorplanning is invoked. If the latter fails, we undo an earlier partitioning decision, merge adjacent placement regions and re-floorplan the larger region to find a legal placement for the macros. Empirically, this framework improves the scalability and quality of results for traditional wirelength-driven floorplanning. It has been validated on recent designs with embedded memories and accounts for routability. Additionally, we propose that free-shape rectilinear floorplanning can be used with rough module-area estimates before synthesis.

[1]  Jens Vygen,et al.  Algorithms for large-scale flat placement , 1997, DAC.

[2]  Shashi Shekhar,et al.  Multilevel hypergraph partitioning: applications in VLSI domain , 1999, IEEE Trans. Very Large Scale Integr. Syst..

[3]  Wayne Wei-Ming Dai,et al.  Topology constrained rectilinear block packing for layout reuse , 1998, ISPD '98.

[4]  Andrew B. Kahng,et al.  Placement feedback: a concept and method for better min-cut placements , 2004, Proceedings. 41st Design Automation Conference, 2004..

[5]  Andrew B. Kahng,et al.  Classical floorplanning harmful? , 2000, ISPD '00.

[6]  Andrew B. Kahng,et al.  Can recursive bisection alone produce routable, placements? , 2000, Proceedings 37th Design Automation Conference.

[7]  Andrew B. Kahng,et al.  Hierarchical whitespace allocation in top-down placement , 2003, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[8]  Igor L. Markov,et al.  Combinatorial techniques for mixed-size placement , 2005, TODE.

[9]  Frank M. Johannes,et al.  Generic global placement and floorplanning , 1998, Proceedings 1998 Design and Automation Conference. 35th DAC. (Cat. No.98CH36175).

[10]  Igor L. Markov,et al.  Fixed-outline floorplanning: enabling hierarchical design , 2003, IEEE Trans. Very Large Scale Integr. Syst..

[11]  J. Cong,et al.  Multi-level placement for large-scale mixed-size IC designs , 2003, Proceedings of the ASP-DAC Asia and South Pacific Design Automation Conference, 2003..

[12]  Igor L. Markov,et al.  On whitespace and stability in mixed-size placement and physical synthesis , 2003, ICCAD-2003. International Conference on Computer Aided Design (IEEE Cat. No.03CH37486).

[13]  Mario R. Casu,et al.  Floorplanning for throughput , 2004, ISPD '04.

[14]  Ulrich Brenner,et al.  An effective congestion driven placement framework , 2002, ISPD '02.

[15]  Majid Sarrafzadeh,et al.  Routability driven white space allocation for fixed-die standard-cell placement , 2002, ISPD '02.

[16]  Jason Cong,et al.  Microarchitecture evaluation with physical planning , 2003, Proceedings 2003. Design Automation Conference (IEEE Cat. No.03CH37451).

[17]  Deepak D. Sherlekar.  Design considerations for regular fabrics , 2004, ISPD '04.

[18]  Jin Xu,et al.  Rectilinear block placement using sequence-pair , 1998, ISPD '98.

[19]  Norbert Wehn,et al.  Embedded DRAM Development: Technology, Physical Design, and Application Issues , 2001, IEEE Des. Test Comput..

[20]  Patrick H. Madden,et al.  Fractional cut: improved recursive bisection placement , 2003, ICCAD-2003. International Conference on Computer Aided Design (IEEE Cat. No.03CH37486).

[21]  Uri C. Weiser,et al.  Interconnect-power dissipation in a microprocessor , 2004, SLIP '04.

[22]  Andrew B. Kahng,et al.  Optimal partitioners and end-case placers for standard-cell layout , 1999, ISPD '99.

[23]  Cheng-Kok Koh,et al.  Recursive bisection based mixed block placement , 2004, ISPD '04.

[24]  Igor L. Markov,et al.  Benchmarking for large-scale placement and beyond , 2004, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[25]  Yici Cai,et al.  MMP: a novel placement algorithm for combined macro block and standard cell layout design , 2000, Proceedings 2000. Design Automation Conference. (IEEE Cat. No.00CH37106).

[26]  Yan Feng,et al.  Constrained floorplanning using network flows , 2004, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.