The interpretation and application of Rent's rule

This paper provides a review of both Rent's rule and the placement models derived from it. It is proposed that the power-law form of Rent's rule, which predicts the number of terminals required by a group of gates for communication with the rest of the circuit, is a consequence of a statistically homogeneous circuit topology and gate placement. The term "homogeneous" is used to imply that quantities such as the average wire length per gate and the average number of terminals per gate are independent of the position within the circuit. Rent's rule is used to derive a variety of net length distribution models and the approach adopted in this paper is to factor the distribution function into the product of an occupancy probability distribution and a function which represents the number of valid net placement sites. This approach places diverse placement models under a common framework and allows the errors introduced by the modeling process to be isolated and evaluated. Models for both planar and hierarchical gate placement are presented.

[1]  Jan M. Van Campenhout,et al.  Towards synthetic benchmark circuits for evaluating timing-driven CAD tools , 1999, ISPD '99.

[2]  Lex A. Akers,et al.  Ultra large scale integrated microelectronics , 1988 .

[3]  Phillip Christie,et al.  The analytical form of the length distribution function for computer interconnection , 1991 .

[4]  Bibiche Micha Geuskens.  Modeling the influence of multilevel interconnect on chip performance , 1998 .

[5]  Kurt Keutzer,et al.  System-Level Performance Modeling with BACPAC - Berkeley Advanced Chip Performance Calculator , 1999 .

[6]  Robert W. Keyes,et al.  The physics of VLSI systems , 1987, Microelectronics systems design series.

[7]  Yu Cao,et al.  GTX: the MARCO GSRC technology extrapolation system , 2000, Proceedings 37th Design Automation Conference.

[8]  J W Goodman,et al.  Implications of interconnection theory for optical digital computing. , 1992, Applied optics.

[9]  Jan M. Van Campenhout,et al.  Accurate Interconnection Length Estimations for Predictions Early in the Design Cycle , 1999, VLSI Design.

[10]  H. B. Bakoglu,et al.  Circuits, interconnections, and packaging for VLSI , 1990 .

[11]  Joni Dambre,et al.  Optoelectronic FPGAs , 1999 .

[12]  D. K. Ferry.  Interconnection lengths and VLSI , 1985, IEEE Circuits and Devices Magazine.

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

[14]  Michael Feuer.  Connectivity of Random Logic , 1982, IEEE Transactions on Computers.

[15]  Wayne Wei-Ming Dai,et al.  A Method for Generation Random Circuits and Its Application to Routability Measurement , 1996, Fourth International ACM Symposium on Field-Programmable Gate Arrays.

[16]  W. Donath.  Wire length distribution for placements of computer logic , 1981 .

[17]  Payman Zarkesh-Ha,et al.  Prediction of interconnect fan-out distribution using Rent's rule , 2000, SLIP '00.

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

[19]  Dirk Stroobandt,et al.  Estimating Interconnection Lengths in Three-Dimensional Computer Systems (Special Issue on Synthesis and Verification of Hardware Design) , 1996 .

[20]  H. B. Bakoglu,et al.  A system-level circuit model for multi- and single-chip CPUs , 1987, 1987 IEEE International Solid-State Circuits Conference. Digest of Technical Papers.

[21]  James D. Meindl,et al.  A generic system simulator (GENESYS) for ASIC technology and architecture beyond 2001 , 1996, Proceedings Ninth Annual IEEE International ASIC Conference and Exhibit.

[22]  Phillip Christie.  A canonical ensemble analysis of interconnect-limited systems , 1991, 1991., IEEE International Sympoisum on Circuits and Systems.

[23]  Phillip Christie,et al.  CLOUDS, COMPUTERS AND COMPLEXITY , 1991 .

[24]  P. Christie.  Rent exponent prediction methods , 2000, IEEE Trans. Very Large Scale Integr. Syst..

[25]  Charles M. Fiduccia,et al.  A linear-time heuristic for improving network partitions , 1988, 25 years of DAC.

[26]  James D. Meindl,et al.  A stochastic wire length distribution for gigascale integration (GSI) , 1997, Proceedings of CICC 97 - Custom Integrated Circuits Conference.

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

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

[29]  Tsuneyo Chiba.  Impact of the LSI on High-Speed Computer Packaging , 1978, IEEE Transactions on Computers.

[30]  A. Masaki,et al.  Equations for Estimating Wire Length in Various Types of 2-D and 3-D System Packaging Structures , 1987 .

[31]  Dirk Stroobandt,et al.  Efficient representation of interconnection length distributions using generating polynomials , 2000, SLIP '00.

[32]  W. Donath.  Equivalence of memory to Random Logic , 1974 .