Interconnect complexity-aware FPGA placement using Rent's rule

Field Programmable Gate Arrays (FPGAs) have gained in commercial acceptance because they offer instant manufacturing turnaround and low costs. However, FPGAs are constantly hard pressed to keep up with the requirements of the more complex and larger scale circuits which are being targeted for them. Routability of a circuit depends on the FPGA architecture, the placement, and the interconnection complexity of the circuit to be placed and routed. This paper explores the use of Rent's rule as a complexity metric for improving the placement of circuits on a target FPGA architecture, such that routing resource utilization is improved. A new simulated annealing based placement algorithm is presented and experimental results are presented to illustrate the validity of the approach for certain example circuits and the ISCAS benchmarks.

[1]  Jan M. Van Campenhout,et al.  Generating synthetic benchmark circuits for evaluating CAD tools , 2000, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[2]  Srinivas Devadas,et al.  Optimal layout via Boolean satisfiability , 1989, 1989 IEEE International Conference on Computer-Aided Design. Digest of Technical Papers.

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

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

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

[6]  Rob A. Rutenbar,et al.  FPGA routing and routability estimation via Boolean satisfiability , 1997, FPGA '97.

[7]  A.B. Kahng,et al.  On the intrinsic Rent parameter and spectra-based partitioning methodologies , 1992, Proceedings EURO-DAC '92: European Design Automation Conference.

[8]  Dirk Stroobandt,et al.  Towards an Extension of Rent's Rule for Describing Local Variations in Interconnection Complexity , 1995 .

[9]  Roy L. Russo,et al.  On a Pin Versus Block Relationship For Partitions of Logic Graphs , 1971, IEEE Transactions on Computers.

[10]  Martine D. F. Schlag,et al.  On Routability Prediction for Field-Programmable Gate Arrays , 1993, 30th ACM/IEEE Design Automation Conference.

[11]  Douglas Chang,et al.  On The Np-completeness Of Regular 2-d Fpga Routing Architectures And A Novel Solution , 1994, IEEE/ACM International Conference on Computer-Aided Design.

[12]  Joseph L. Ganley,et al.  An architecture-independent approach to FPGA routing based on multi-weighted graphs , 1994, EURO-DAC '94.

[13]  Jonathan Rose,et al.  A stochastic model to predict the routability of field-programmable gate arrays , 1993, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[14]  Malgorzata Marek-Sadowska,et al.  Graph based analysis of 2-D FPGA routing , 1996, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[15]  Vaughn Betz,et al.  VPR: A new packing, placement and routing tool for FPGA research , 1997, FPL.

[16]  André DeHon,et al.  Balancing interconnect and computation in a reconfigurable computing array (or, why you don't really want 100% LUT utilization) , 1999, FPGA '99.

[17]  Rob A. Rutenbar,et al.  FPGA Routing and Routability Estimation , 1998 .