A stochastic model for estimating measures of placement and routing on gate arrays is presented. Three important problems are addressed: estimating the dimensions of the routing channels, estimating the routability of a channel given the number of tracks, and determining the distribution and moments of wire lengths. In the context of wiring space estimation, exact and asymptotic formulas for the dimensions of routing channels are presented. Next, an expression for the probability that a routing channel with a given number of tracks will be routable is derived, and its asymptotic properties are examined. Finally, a model that characterizes the relationship between wire length distributions and partitioning of logic is developed. The model provides a firm mathematical basis for Rent's rule from which the distribution of wire lengths can be determined. That is, Rent's rule, or in general any similar relation, contains all the information about wire lengths. Based on this, estimates for the average wire length are derived. Numerical results from both simulated and real chips are presented.
[1]
W. Donath.
Wire length distribution for placements of computer logic
,
1981
.
[2]
Michael Feuer.
Connectivity of Random Logic
,
1982,
IEEE Transactions on Computers.
[3]
Abbas El Gamal,et al.
Two-dimensional stochastic model for interconnections in master-slice integrated circuits
,
1981
.
[4]
Ivan E. Sutherland,et al.
How Big Should a Printed Circuit Board Be?
,
1973,
IEEE Transactions on Computers.
[5]
William E. Donath,et al.
Placement and average interconnection lengths of computer logic
,
1979
.
[6]
Roy L. Russo.
On the Tradeoff Between Logic Performance and Circuit-to-Pin Ratio for LSI
,
1972,
IEEE Transactions on Computers.