一种性能驱动的分层分区放置算法

T. Gao, C. Liu, Kuang-Chien Chen
{"title":"一种性能驱动的分层分区放置算法","authors":"T. Gao, C. Liu, Kuang-Chien Chen","doi":"10.1109/EURDAC.1993.410613","DOIUrl":null,"url":null,"abstract":"A new hierarchical partitioning placement algorithm is presented. The objective function is formulated as a weighted sum of the total wire length and the maximum circuit delay. Special balancing rules are used to assure a good balance between the numbers of components in the regions. Total wire length and maximum circuit delay are estimated and updated efficiently at each step of the partitioning process. Experimental results are very encouraging.<<ETX>>","PeriodicalId":339176,"journal":{"name":"Proceedings of EURO-DAC 93 and EURO-VHDL 93- European Design Automation Conference","volume":"19 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1993-09-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"6","resultStr":"{\"title\":\"A performance driven hierarchical partitioning placement algorithm\",\"authors\":\"T. Gao, C. Liu, Kuang-Chien Chen\",\"doi\":\"10.1109/EURDAC.1993.410613\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A new hierarchical partitioning placement algorithm is presented. The objective function is formulated as a weighted sum of the total wire length and the maximum circuit delay. Special balancing rules are used to assure a good balance between the numbers of components in the regions. Total wire length and maximum circuit delay are estimated and updated efficiently at each step of the partitioning process. Experimental results are very encouraging.<<ETX>>\",\"PeriodicalId\":339176,\"journal\":{\"name\":\"Proceedings of EURO-DAC 93 and EURO-VHDL 93- European Design Automation Conference\",\"volume\":\"19 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1993-09-20\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"6\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of EURO-DAC 93 and EURO-VHDL 93- European Design Automation Conference\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/EURDAC.1993.410613\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of EURO-DAC 93 and EURO-VHDL 93- European Design Automation Conference","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/EURDAC.1993.410613","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 6

摘要

提出了一种新的分层分区放置算法。目标函数表示为总导线长度和最大电路延迟的加权和。使用特殊的平衡规则来确保区域中组件数量之间的良好平衡。总导线长度和最大电路延迟在划分过程的每一步有效地估计和更新。实验结果非常鼓舞人心。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
A performance driven hierarchical partitioning placement algorithm
A new hierarchical partitioning placement algorithm is presented. The objective function is formulated as a weighted sum of the total wire length and the maximum circuit delay. Special balancing rules are used to assure a good balance between the numbers of components in the regions. Total wire length and maximum circuit delay are estimated and updated efficiently at each step of the partitioning process. Experimental results are very encouraging.<>
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信