Rent's rule

From Wikipedia, the free encyclopedia

Rent's rule pertains to the organization of computing logic, specifically the relationship between the number of external signal connections to a logic block (i.e., the number of "pins") with the number of logic gates in the logic block, and has been applied to circuits ranging from small digital circuits to mainframe computers.

E.F. Rent's discovery and first publications

In the 1960s, E.F. Rent, an IBM employee, found a remarkable trend between the number of pins (terminals T) at the boundaries of integrated circuit designs at IBM and the number of internal components (g), such as logic gates or standard cells. On a log-log plot, these datapoints were on a straight line, implying a power-law relation T=tg^{p} where t and p are constants (p < 1.0, and generally 0.5 < p < 0.8).

Rent disclosed his findings in IBM-internal memoranda that were published in the IBM Journal of Research and Development in 2005 (IBM J. Res. & Dev. Vol. 49, No. 4/5 July/September 2005, pp. 777–803), but the relation was described in 1971 by Landman and Russo.[1] They performed a hierarchical circuit partitioning in such a way that at each hierarchical level (top-down) the least number of interconnections had to be cut to partition the circuit (in more or less equal parts). At each partitioning step, they noted the number of terminals and the number of components in each partition and then partitioned the sub-partitions further. They found the power law rule applied to the resulting T versus g plot and named it "Rent's rule".

It is crucial to recognise that Rent's rule is an empirical result based on observations of existing designs, and therefore it is less applicable to the analysis of non-traditional circuit architectures. Having said that, it does provide a useful framework with which to compare similar architectures.

Theoretical basis

Christie and Stroobandt[2] later derived Rent's rule theoretically for homogeneous systems and pointed out that the amount of optimization achieved in placement is reflected by the parameter p, the "Rent exponent", which also depends on the circuit topology. In particular, values p<1 correspond to a greater fraction of short interconnects. The constant t in Rent's rule can be viewed as the average number of terminals required by a single logic block since T=t when g=1.

Special cases and applications

Random arrangement of logic blocks typically have p=1. Larger values are impossible since the maximum number of terminals for any region containing g logic components in a homogeneous system is given by T=tg. Lower bounds on p depend on the interconnection topology since it is generally impossible to make all wires short. This lower bound p* is often called the "intrinsic Rent exponent", a notion first introduced by Hagen et al.[3] It can be used to characterize optimal placements and also measure the interconnection complexity of a circuit. Higher (intrinsic) Rent exponent values correspond to a higher topological complexity. One extreme example (p=0) is a long chain of logic blocks, while a clique has p=1. In realistic 2D circuits, p* ranges from 0.5 for highly-regular circuits (such as SRAM) to 0.75 for random logic.[4]

System performance analysis tools such as BACPAC typically use Rent's rule to calculate expected wiring lengths and wiring demands.

Estimating Rent's exponent

To estimate Rent's exponent, one can use top-down partitioning, as used in min-cut placement. For every partition, count the number of terminals connected to the partition and compare it to the number of logic blocks in the partition. Rent's exponent can then be found by fitting these datapoints on a log-log plot, resulting in an exponent p'. For optimally partitioned circuits, p'=p* but this is no longer the case for practical (heuristic) partitioning approaches. For partitioning-based placement algorithms p^{*}\leq p'\leq p.[5]

Region II of Rent's rule

Landman and Russo found a deviation of Rent's rule near the "far end", i.e., for partitions with a large number of blocks, which is known as "Region II" of Rent's Rule.[1] A similar deviation exists at for small partitions, and has been found by Stroobandt[6] who called it Region III.

Rentian wirelength estimation

Another IBM employee, Donath, discovered that Rent's rule can be used to estimate the average wirelength and the wirelength distribution in VLSI chips.[7][8] This motivated the System Level Interconnect Prediction workshop, founded in 1999, and an entire community working on wirelength prediction (see a survey by Stroobandt[9]). The resulting wirelength estimates have been improved significantly since then and are now used for "technology exploration."[10] The use of Rent's rule allows to perform such estimates a priori (i.e., before actual placement) and thus predict the properties of future technologies (clock frequencies, number of routing layers needed, area, power) based on limited information about future circuits and technologies.

A comprehensive overview of work based on Rent's rule has been published by Stroobandt.[9] [11]

See also

References

  1. ↑ 1.0 1.1 B. S. Landman and R. L. Russo, On a Pin Versus Block Relationship For Partitions of Logic Graphs, IEEE Trans. on Comput., col. C-20, pp. 1469-1479, 1971.
  2. ↑ P. Christie and D. Stroobandt, The Interpretation and Application of Rent's Rule, IEEE Trans. on VLSI Systems, Special Issue on System-Level Interconnect Prediction, vol. 8, no. 6, pp. 639-648, 2000.
  3. ↑ L. Hagen, A. B. Kahng, F. J. Kurdahi and C. Ramachandran, On the Intrinsic Rent Parameter and Spectra-based Partitioning Methodologies, IEEE Trans. on Comput.-Aided Des., Integrated Circuits \& Syst., vol. 13, no. 1, pages 27 - 37, 1994.
  4. ↑ R. L. Russo, On the Tradeoff Between Logic Performance and Circuit-to-Pin Ratio for LSI, IEEE Trans. Comput., vol. C - 21, pages 147 - 153, 1972.
  5. ↑ P. Verplaetse, J. Dambre, D. Stroobandt, and J. Van Campenhout, On Partitioning vs. Placement Rent Properties, Intl. Workshop on System-Level Interconnect Prediction (SLIP 2001), pp. 33 - 40, March 2001.
  6. ↑ D. Stroobandt, On an efficient method for estimating the interconnection complexity of designs and on the existence of region III in Rent's rule, Proc. 9th Great Lakes Symposium on VLSI, pp. 330 - 331, 1999.
  7. ↑ W. E. Donath, Placement and Average Interconnection Lengths of Computer Logic, IEEE Trans. Circuits & Syst., vol. CAS-26, pp. 272 - 277, 1979.
  8. ↑ W. E. Donath, Wire Length Distribution for Placements of Computer Logic, IBM J. of Research and Development, vol. 25, pp. 152 - 155, 1981.
  9. ↑ 9.0 9.1 D. Stroobandt, A Priori Wire Length Estimates for Digital Design. Kluwer Academic Publishers. ISBN 0-7923-7360-X. 2001. pp. 298.
  10. ↑ A. E. Caldwell, Y. Cao, A. B. Kahng, F. Koushanfar, H. Lu, I. L. Markov, M. Oliver, D. Stroobandt, and D. Sylvester, GTX: The MARCO GSRC Technology Extrapolation System, IEEE/ACM Design Automation Conf., pp. 693 - 698, June 2000.
  11. ↑ D. Stroobandt, Recent Advances in System-Level Interconnect Prediction, IEEE Circuits and Systems Society Newsletter, vol. 11, no. 4, pages 1; 4-20; 48, December 2000. Invited. Available at http://www.nd.edu/~stjoseph/newscas/.
This article is issued from Wikipedia. The text is available under the Creative Commons Attribution/Share Alike; additional terms may apply for the media files.