{"title":"On the Relation between Wire Length Distributions and Placement of Logic on Master Slice ICs","authors":"S. Sastry, A. C. Parker","doi":"10.5555/800033.800891","DOIUrl":null,"url":null,"abstract":"The quality of placement and routing on gate arrays is commonly measured by average wire length. With regard to wire length, placement and routing are mutually competing tasks and the solution space for both is exponential. Estimates of measures of placement such as average wire length or, total wiring tracks prior to routing give some indication of the routability of the placement and, can be used to select another placement and repeat.\n The nature of these problems necessitates a probabilistic approach to the wirability analysis of integrated circuits. Stochastic models for wiring space estimation and the relation between wire length distribution and placement optimization have received attention recently [1], [6], [2], [5], [7], [3] and [4]. Much of the reported work on wire length distributions and placement of logic rests on empirical evidence that indicates that “well placed” chips exhibit Rent's Rule between the number of components and the number of corresponding external connections. Rent's Rule has been the basis of the heuristic arguments used to derive upper bounds on the average wire length and the form of the wire length distribution. Rent's Rule has the form\n T &equil; KC p (1)\n where T is the average number of external connections, C is the average number of components, K is number of connections per component and p is a positive constant. In [1], [2] and [4] the effect of placement on wire length distribution was introduced by assuming that a hierarchical partitioning scheme aimed at minimizing the average wire length results in a configuration that exhibits Rent's Rule. In [2] an upper bound r@@@@k for the average wire length between elements of different subsets of components of size k was derived, and using Rent's Rule to obtain the number of connections between such subsets, an upper bound on the average wire length was derived. In [3] the Pareto distribution is proposed for the distribution of wire lengths. Similar results were presented in [4].\n In this paper we present a model that provides a mathematical basis for Rent's Rule and its relation to wire length distribution. It will be shown that Rent's Rule, an observed fact, is a manifestation of a more fundamental underlying process characterized by a function which leads directly to a general class of wire length distributions, the Weibull family. That is, Rent's Rule contains all the information about the distribution of wire lengths. Thus, estimates for the average wire length can be derived. Theory presented here is substantiated by simulation results and earlier research data.","PeriodicalId":188431,"journal":{"name":"21st Design Automation Conference Proceedings","volume":"4 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1984-06-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"11","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"21st Design Automation Conference Proceedings","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.5555/800033.800891","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 11
Abstract
The quality of placement and routing on gate arrays is commonly measured by average wire length. With regard to wire length, placement and routing are mutually competing tasks and the solution space for both is exponential. Estimates of measures of placement such as average wire length or, total wiring tracks prior to routing give some indication of the routability of the placement and, can be used to select another placement and repeat.
The nature of these problems necessitates a probabilistic approach to the wirability analysis of integrated circuits. Stochastic models for wiring space estimation and the relation between wire length distribution and placement optimization have received attention recently [1], [6], [2], [5], [7], [3] and [4]. Much of the reported work on wire length distributions and placement of logic rests on empirical evidence that indicates that “well placed” chips exhibit Rent's Rule between the number of components and the number of corresponding external connections. Rent's Rule has been the basis of the heuristic arguments used to derive upper bounds on the average wire length and the form of the wire length distribution. Rent's Rule has the form
T &equil; KC p (1)
where T is the average number of external connections, C is the average number of components, K is number of connections per component and p is a positive constant. In [1], [2] and [4] the effect of placement on wire length distribution was introduced by assuming that a hierarchical partitioning scheme aimed at minimizing the average wire length results in a configuration that exhibits Rent's Rule. In [2] an upper bound r@@@@k for the average wire length between elements of different subsets of components of size k was derived, and using Rent's Rule to obtain the number of connections between such subsets, an upper bound on the average wire length was derived. In [3] the Pareto distribution is proposed for the distribution of wire lengths. Similar results were presented in [4].
In this paper we present a model that provides a mathematical basis for Rent's Rule and its relation to wire length distribution. It will be shown that Rent's Rule, an observed fact, is a manifestation of a more fundamental underlying process characterized by a function which leads directly to a general class of wire length distributions, the Weibull family. That is, Rent's Rule contains all the information about the distribution of wire lengths. Thus, estimates for the average wire length can be derived. Theory presented here is substantiated by simulation results and earlier research data.