Multilevel floorplanning/placement for large-scale modules using B*-trees

We present in this paper a multilevel floorplanning/placement framework based on the B*-tree representation, called MB*-tree, to handle the floorplanning and packing for large-scale building modules. The MB*-tree adopts a two-stage technique, clustering followed by declustering. The clustering stage iteratively groups a set of modules based on a cost metric guided by area utilization and module connectivity, and at the same time establishes the geometric relations for the newly clustered modules by constructing a corresponding B*-tree for them. The declustering stage iteratively ungroup a set of the previously clustered modules (i.e., perform tree expansion) and then refines the floorplanning/placement solution by using a simulated annealing scheme. In particular, the MB*-tree preserves the geometric relations among modules during declustering, which makes the MB*-tree an ideal data structure for the multilevel floorplanning/placement framework. Experimental results show that the MB*-tree obtains significantly better silicon area and wirelength than previous works. Further, unlike previous works, MB*-tree scales very well as the circuit size increases.

[1]  Dennis J.-H. Huang,et al.  Multilevel Circuit Partitioning , 1997, Proceedings of the 34th Design Automation Conference.

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

[3]  Jason Cong,et al.  Multilevel approach to full-chip gridless routing , 2001, IEEE/ACM International Conference on Computer Aided Design. ICCAD 2001. IEEE/ACM Digest of Technical Papers (Cat. No.01CH37281).

[4]  Evangeline F. Y. Young,et al.  Floorplan area minimization using Lagrangian relaxation , 2000, ISPD '00.

[5]  R. Otten.  Automatic Floorplan Design , 1982, DAC 1982.

[6]  Yao-Wen Chang,et al.  TCG: a transitive closure graph-based representation for non-slicing floorplans , 2001, DAC '01.

[7]  Jason Cong,et al.  An enhanced multilevel routing system , 2002, IEEE/ACM International Conference on Computer Aided Design, 2002. ICCAD 2002..

[8]  Bruce Hendrickson,et al.  A Multi-Level Algorithm For Partitioning Graphs , 1995, Proceedings of the IEEE/ACM SC95 Conference.

[9]  Joseph R. Shinnerl,et al.  Multilevel optimization for large-scale circuit placement , 2000, IEEE/ACM International Conference on Computer Aided Design. ICCAD - 2000. IEEE/ACM Digest of Technical Papers (Cat. No.00CH37140).

[10]  Yao-Wen Chang,et al.  Noise-aware buffer planning for interconnect-driven floorplanning , 2003, ASP-DAC '03.

[11]  Cheng-Kok Koh,et al.  Routability-driven repeater block planning for interconnect-centric floorplanning , 2000, ISPD '00.

[12]  Yao-Wen Chang,et al.  Noise-aware buffer planning for interconnect-driven floorplanning , 2003, Proceedings of the ASP-DAC Asia and South Pacific Design Automation Conference, 2003..

[13]  Yao-Wen Chang,et al.  Corner sequence - a P-admissible floorplan representation with a worst case linear-time packing scheme , 2003, IEEE Trans. Very Large Scale Integr. Syst..

[14]  Sachin S. Sapatnekar,et al.  A practical methodology for early buffer and wire resource allocation , 2003, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[15]  H. Murata,et al.  Rectangle-packing-based module placement , 1995, Proceedings of IEEE International Conference on Computer Aided Design (ICCAD).

[16]  Jing-Yang Jou,et al.  Simultaneous floorplanning and buffer block planning , 2003, Proceedings of the ASP-DAC Asia and South Pacific Design Automation Conference, 2003..

[17]  Yao-Wen Chang,et al.  A novel framework for multilevel routing considering routability and performance , 2002, IEEE/ACM International Conference on Computer Aided Design, 2002. ICCAD 2002..

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