Traffic: a novel geometric algorithm for fast wire-optimized floorplanning

As the size and complexity of very large scale integrated (VLSI) circuits increase, the need for faster floorplanning algorithms also grows. This paper introduces trapezoidal floorplanning for integrated circuits (Traffic), a new method for creating wire- and area-optimized floorplans. Through the use of connectivity grouping, simple geometry, and a constrained brute-force approach, Traffic achieves an average of 18% lower wire estimate than simulated annealing (SA) in orders of magnitude less time. This speed allows designers to rapidly explore a large circuit design space, to evaluate small changes to big circuits, to fit bounding boxes, and to produce initial solutions for other floorplanning algorithms

[1]  Yoji Kajitani,et al.  Rectangle-packing-based module placement , 1995, ICCAD.

[2]  Wayne Wei-Ming Dai,et al.  Hierarchical placement and floorplanning in BEAR , 1989, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[3]  Shashi Shekhar,et al.  Multilevel hypergraph partitioning: application in VLSI domain , 1997, DAC.

[4]  Evangeline F. Y. Young,et al.  A unified method to handle different kinds of placement constraints in floorplan design , 2002, Proceedings of ASP-DAC/VLSI Design 2002. 7th Asia and South Pacific Design Automation Conference and 15h International Conference on VLSI Design.

[5]  Carl Sechen.  AVERAGE INTERCONNECTION LENGTH ESTIMATION FOR RANDOM AND OPTIMIZED PLACEMENTS. , 1987 .

[6]  William E. Donath,et al.  Placement and average interconnection lengths of computer logic , 1979 .

[7]  Jason Cong,et al.  Retiming-based timing analysis with an application to mincut-based global placement , 2004, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[8]  Abbas El Gamal,et al.  Two-dimensional stochastic model for interconnections in master-slice integrated circuits , 1981 .

[9]  Hsien-Hsin S. Lee,et al.  Profile-guided microarchitectural floor planning for deep submicron processor design , 2006, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[10]  Martin D. F. Wong,et al.  Floorplanning with alignment and performance constraints , 2002, DAC '02.

[11]  Yao-Wen Chang,et al.  B*-Trees: a new representation for non-slicing floorplans , 2000, DAC.

[12]  Dinesh Bhatia,et al.  A methodology for fast FPGA floorplanning , 1999, FPGA '99.

[13]  Russell Tessier.  Fast placement approaches for FPGAs , 2002, TODE.

[14]  Sungho Kang,et al.  Linear Ordering and Application to Placement , 1983, 20th Design Automation Conference Proceedings.

[15]  Majid Sarrafzadeh,et al.  Fast and accurate estimation of floorplans in logic/high-level synthesis , 2000, ACM Great Lakes Symposium on VLSI.

[16]  Jason Cong,et al.  Physical planning with retiming , 2000, IEEE/ACM International Conference on Computer Aided Design. ICCAD - 2000. IEEE/ACM Digest of Technical Papers (Cat. No.00CH37140).

[17]  Jason Cong,et al.  Edge separability-based circuit clustering with application to multilevel circuit partitioning , 2004, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[18]  George Karypis,et al.  Multilevel Hypergraph Partitioning , 2003 .

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

[20]  Martin D. F. Wong,et al.  Floorplan design of VLSI circuits , 2005, Algorithmica.

[21]  Brian W. Kernighan,et al.  A Procedure for Placement of Standard-Cell VLSI Circuits , 1985, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[22]  C. L. Liu,et al.  Area minimization for general floorplans , 1992, ICCAD.

[23]  S. Shekhar,et al.  Multilevel Hypergraph Partitioning: Application In Vlsi Domain , 1997, Proceedings of the 34th Design Automation Conference.

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

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

[26]  Sung Kyu Lim,et al.  Multi-layer floorplanning for reliable system-on-package , 2004, 2004 IEEE International Symposium on Circuits and Systems (IEEE Cat. No.04CH37512).

[27]  Massoud Pedram,et al.  Interconnection length estimation for optimized standard cell layouts , 1989, 1989 IEEE International Conference on Computer-Aided Design. Digest of Technical Papers.

[28]  Kaushik Roy,et al.  Decoupling capacitance allocation and its application topower-supply noise-aware floorplanning , 2002, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[29]  Evangeline F. Y. Young,et al.  Slicing floorplans with pre-placed modules , 1998, 1998 IEEE/ACM International Conference on Computer-Aided Design. Digest of Technical Papers (IEEE Cat. No.98CB36287).

[30]  C. D. Gelatt,et al.  Optimization by Simulated Annealing , 1983, Science.

[31]  Chung-Kuan Cheng,et al.  A wire length estimation technique utilizing neighborhood density equations , 1992, DAC '92.

[32]  Igor L. Markov,et al.  Fixed-outline floorplanning through better local search , 2001, Proceedings 2001 IEEE International Conference on Computer Design: VLSI in Computers and Processors. ICCD 2001.

[33]  Majid Sarrafzadeh,et al.  Fast floorplanning for effective prediction and construction , 2001, IEEE Trans. Very Large Scale Integr. Syst..

[34]  Ting-Chi Wang,et al.  An optimal algorithm for floorplan area optimization , 1990, 27th ACM/IEEE Design Automation Conference.

[35]  Martin D. F. Wong,et al.  Fast evaluation of sequence pair in block placement by longest common subsequence computation , 2000, DATE '00.

[36]  Weiping Shi,et al.  A fast algorithm for area minimization of slicing floorplans , 1996, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..