Module placement based on quadratic programming and rectangle packing using less flexibility first principle

We formulate the floorplanning or placement problem as fixed die and connectivity-oriented problem. To solve such a problem, we first use quadratic programming to optimize the total wire-length of the placement and then using a deterministic rectangle packing algorithm based on less flexibility first principle to fulfill the placement in an estimated fixed die area. Experimental results demonstrated that our method is promising for practical use.

[1]  Yici Cai,et al.  Corner block list: an effective and efficient topological representation of non-slicing floorplan , 2000, IEEE/ACM International Conference on Computer Aided Design. ICCAD - 2000. IEEE/ACM Digest of Technical Papers (Cat. No.00CH37140).

[2]  Yeong-Dae Kim,et al.  A linear programming-based algorithm for floorplanning in VLSI design , 2003, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[3]  Martin D. F. Wong,et al.  A New Algorithm for Floorplan Design , 1986, 23rd ACM/IEEE Design Automation Conference.

[4]  Yoji Kajitani,et al.  Module placement on BSG-structure and IC layout applications , 1996, ICCAD 1996.

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

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

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

[8]  Takeshi Yoshimura,et al.  An O-tree representation of non-slicing floorplan and its applications , 1999, DAC '99.

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

[10]  H. Murata,et al.  Rectangle-packing-based module placement , 1995, ICCAD 1995.