Large-scale fixed-outline floorplanning design using convex optimization techniques

A two-stage optimization methodology is proposed to solve the fixed-outline floorplanning problem that is a global optimization problem for wirelength minimization. In the first stage, an attractor-repeller convex optimization model provides the relative positions of the modules on the floorplan. The second stage places and sizes the modules using second-order cone optimization. A Voronoi diagram is employed to obtain a planar graph and thus a relative position matrix to connect the two stages. Overlap-free and deadspace-free floorplans are achieved in a fixed outline and floorplans with any specified percentage of whitespace can be produced. Experimental results on GSRC benchmarks demonstrate that we obtain significant improvements on the best results known in the literature for these benchmarks. Most importantly, our methodology provides greater improvement over other floor-planners as the number of modules increases.

[1]  Evangeline F. Y. Young,et al.  How good are slicing floorplans? , 1997, Integr..

[2]  Takeshi Yoshimura,et al.  A stable fixed-outline floorplanning method , 2007, ISPD '07.

[3]  Brian W. Kernighan,et al.  AMPL: A Modeling Language for Mathematical Programming , 1993 .

[4]  D. T. Lee,et al.  The hausdorff voronoi diagram of polygonal objects: a divide and conquer approach , 2004, Int. J. Comput. Geom. Appl..

[5]  Sheqin Dong,et al.  An efficient algorithm to fixed-outline floorplanning based on instance augmentation , 2005, Ninth International Conference on Computer Aided Design and Computer Graphics (CAD-CG'05).

[6]  Kai Wang,et al.  A class of zero wasted area floorplan for VLSI design , 1993, 1993 IEEE International Symposium on Circuits and Systems.

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

[8]  Yao-Wen Chang,et al.  Modern floorplanning based on fast simulated annealing , 2005, ISPD '05.

[9]  Anthony Vannelli,et al.  A New Mathematical-Programming Framework for Facility-Layout Design , 2006, INFORMS J. Comput..

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

[11]  Margarida F. Jacome,et al.  A tight area upper bound for slicing floorplans , 2000, VLSI Design 2000. Wireless and Digital Imaging in the Millennium. Proceedings of 13th International Conference on VLSI Design.

[12]  Yao-Wen Chang,et al.  IMF: interconnect-driven multilevel floorplanning for large-scale building-module designs , 2005, ICCAD-2005. IEEE/ACM International Conference on Computer-Aided Design, 2005..

[13]  Anthony Vannelli,et al.  An Attractor-Repeller approach to floorplanning , 2002, Math. Methods Oper. Res..

[14]  Stephen P. Boyd,et al.  Applications of second-order cone programming , 1998 .

[15]  S. Hakimi,et al.  Globally optimal floorplanning for a layout problem , 1996 .

[16]  De-Sheng Chen,et al.  Fixed-outline floorplanning using robust evolutionary search , 2007, Eng. Appl. Artif. Intell..

[17]  Joseph R. Shinnerl,et al.  Fast floorplanning by look-ahead enabled recursive bipartitioning , 2006, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[18]  Dinesh P. Mehta,et al.  On the use of flexible, rectilinear blocks to obtain minimum-area floorplans in mixed block and cell designs , 2000, TODE.

[19]  Alberto L. Sangiovanni-Vincentelli,et al.  TimberWolf3.2: A New Standard Cell Placement and Global Routing Package , 1986, 23rd ACM/IEEE Design Automation Conference.

[20]  Sung Kyu Lim,et al.  Traffic: a novel geometric algorithm for fast wire-optimized floorplanning , 2006, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[21]  Jarrod A. Roy,et al.  Unification of partitioning, placement and floorplanning , 2004, ICCAD 2004.

[22]  Yan Feng,et al.  Module relocation to obtain feasible constrained floorplans , 2006, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[23]  Martin D. F. Wong,et al.  Minimizing wire length in floorplanning , 2006, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[24]  Sherief Reda,et al.  Effective linear programming based placement methods , 2006, ISPD '06.

[25]  Faming Liang,et al.  Relaxed simulated tempering for VLSI floorplan designs , 1999, Proceedings of the ASP-DAC '99 Asia and South Pacific Design Automation Conference 1999 (Cat. No.99EX198).

[26]  Ernest S. Kuh,et al.  Sequence-pair based placement method for hard/soft/pre-placed modules , 1998, ISPD '98.

[27]  Yan Feng,et al.  A fixed-die floorplanning algorithm using an analytical approach , 2006, Asia and South Pacific Conference on Design Automation, 2006..

[28]  S. Sitharama Iyengar,et al.  A 'retraction' method for learned navigation in unknown terrains for a circular robot , 1991, IEEE Trans. Robotics Autom..

[29]  Yan Feng,et al.  Constrained floorplanning with whitespace , 2004, 17th International Conference on VLSI Design. Proceedings..

[30]  Yao-Wen Chang,et al.  Modern floorplanning based on B/sup */-tree and fast simulated annealing , 2006, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[31]  Israel Koren,et al.  Floorplans, planar graphs and layouts , 1988 .

[32]  David Z. Pan,et al.  Computational geometry based placement migration , 2005, ICCAD-2005. IEEE/ACM International Conference on Computer-Aided Design, 2005..

[33]  De-Sheng Chen,et al.  Modern Floorplanning with Boundary and Fixed-outline Constraints via Genetic Clustering Algorithm , 2006, J. Circuits Syst. Comput..

[34]  Michael C. Ferris,et al.  NEOS and Condor: solving optimization problems over the Internet , 2000, TOMS.

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

[36]  Deok-Soo Kim,et al.  A sweepline algorithm for Euclidean Voronoi diagram of circles , 2006, Comput. Aided Des..

[37]  Chang-Tzu Lin,et al.  Robust fixed-outline floorplanning through evolutionary search , 2004, ASP-DAC.

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