Efficient circuit clustering for area and power reduction in FPGAs

We utilize Rent's rule as an empirical measure for efficient clustering and placement of circuits in clustered Field Programmable Gate Arrays (FPGAs). We show that careful matching of resource availability and design complexity during the clustering and placement processes can contribute to spatial uniformity in the placed design, leading to overall device decongestion after routing. We present experimental results to show that appropriate logic depopulation during clustering can have a positive impact on the overall FPGA device area. Our clustering and placement techniques can improve the overall device routing area by as much as 62%, 35% on average, for the same array size, when compared to state-of-the-art FPGA clustering, placement, and routing tools. Power dissipation simulations using a typical buffered pass-transistor-based FPGA interconnect model are also presented. They show that our clustering and placement techniques can reduce the overall device power dissipation by approximately 13%.

[1]  Vaughn Betz,et al.  Architecture and CAD for Deep-Submicron FPGAS , 1999, The Springer International Series in Engineering and Computer Science.

[2]  Payman Zarkesh-Ha,et al.  Prediction of net-length distribution for global interconnects in a heterogeneous system-on-a-chip , 2000, IEEE Trans. Very Large Scale Integr. Syst..

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

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

[5]  Fadi J. Kurdahi,et al.  On the intrinsic rent parameter and spectra-based partitioning methodologies , 1992, EURO-DAC '92.

[6]  Majid Sarrafzadeh,et al.  RPack: routability-driven packing for cluster-based FPGAs , 2001, ASP-DAC '01.

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

[8]  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..

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

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

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

[12]  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.

[13]  Louis Scheffer,et al.  Why interconnect prediction doesn't work , 2000, SLIP '00.

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

[15]  Malgorzata Marek-Sadowska,et al.  Interconnect resource-aware placement for hierarchical FPGAs , 2001, ICCAD.

[16]  Jason Cong,et al.  FlowMap: an optimal technology mapping algorithm for delay optimization in lookup-table based FPGA designs , 1994, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[17]  Vaughn Betz,et al.  Speed and area tradeoffs in cluster-based FPGA architectures , 2000, IEEE Trans. Very Large Scale Integr. Syst..

[18]  Malgorzata Marek-Sadowska,et al.  Interconnect complexity-aware FPGA placement using Rent's rule , 2001, SLIP '01.

[19]  Vaughn Betz,et al.  Cluster-based logic blocks for FPGAs: area-efficiency vs. input sharing and size , 1997, Proceedings of CICC 97 - Custom Integrated Circuits Conference.

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

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

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

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

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

[25]  Rob A. Rutenbar,et al.  FPGA routing and routability estimation via Boolean satisfiability , 1998, IEEE Trans. Very Large Scale Integr. Syst..