主片ic上导线长度分布与逻辑布局的关系

S. Sastry, A. C. Parker
{"title":"主片ic上导线长度分布与逻辑布局的关系","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":"{\"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}","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

摘要

门阵列的放置和布线质量通常用平均导线长度来衡量。关于导线长度,布置和布线是相互竞争的任务,两者的解空间都是指数级的。在布线之前,对布线措施(如平均导线长度或总布线轨迹)的估计给出了布线可达性的一些指示,并可用于选择另一个布线并重复。这些问题的性质要求采用概率方法来分析集成电路的连接性。[1],[6],[2],[5],[7],[3]和[4]是近年来备受关注的布线空间估计和布线长度分布与布线优化关系的随机模型。许多关于导线长度分布和逻辑布局的报道都是基于经验证据,这些证据表明,“布局良好”的芯片在组件数量和相应的外部连接数量之间表现出“Rent’s Rule”。Rent’s Rule是启发式论证的基础,用于推导平均导线长度的上界和导线长度分布的形式。Rent’s Rule的形式为T & equal;KC p(1)其中T为平均外部连接数,C为平均组件数,K为每个组件的连接数,p为正常数。在[1]、[2]和[4]中,放置对导线长度分布的影响是通过假设一个旨在最小化平均导线长度的分层分区方案导致符合Rent’s Rule的配置来引入的。在[2]中,导出了大小为k的组件的不同子集的元素之间的平均导线长度的上界r@@@@k,并利用Rent’s Rule获得这些子集之间的连接数,导出了平均导线长度的上界r@@@@k。在[3]中,提出了导线长度分布的帕累托分布。b[4]中也出现了类似的结果。在本文中,我们提出了一个模型,为Rent’s Rule及其与导线长度分布的关系提供了数学基础。我们将会看到,一个观察到的事实,是一个更基本的潜在过程的表现,其特征是一个函数,它直接导致了一般的线长分布,即威布尔族。也就是说,Rent’s Rule包含了关于导线长度分布的所有信息。因此,可以推导出平均导线长度的估计值。本文的理论得到了仿真结果和早期研究数据的证实。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
On the Relation between Wire Length Distributions and Placement of Logic on Master Slice ICs
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.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信