分级设计环境中时序驱动的引脚分配

G. Meixner, G. Zimmermann
{"title":"分级设计环境中时序驱动的引脚分配","authors":"G. Meixner, G. Zimmermann","doi":"10.1109/EUASIC.1991.212865","DOIUrl":null,"url":null,"abstract":"Presents a method for taking into account timing constraints during pin assignment, a subtask of floorplanning. Previous approaches to the pin assignment problem determine pin positions or admissible intervals on the block perimeters with the lengths of the respective nets as the only objective. Th authors describe a delay model for hierarchical combinational circuits which defines a linkage between the pins of different global nets in terms of timing dependencies. Based on this model they propose a slack optimization algorithm, which optimizes pin positions and routes for the global nets with respect to the timing requirements.<<ETX>>","PeriodicalId":118990,"journal":{"name":"Euro ASIC '91","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1991-05-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Timing driven pin assignment in a hierarchical design environment\",\"authors\":\"G. Meixner, G. Zimmermann\",\"doi\":\"10.1109/EUASIC.1991.212865\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Presents a method for taking into account timing constraints during pin assignment, a subtask of floorplanning. Previous approaches to the pin assignment problem determine pin positions or admissible intervals on the block perimeters with the lengths of the respective nets as the only objective. Th authors describe a delay model for hierarchical combinational circuits which defines a linkage between the pins of different global nets in terms of timing dependencies. Based on this model they propose a slack optimization algorithm, which optimizes pin positions and routes for the global nets with respect to the timing requirements.<<ETX>>\",\"PeriodicalId\":118990,\"journal\":{\"name\":\"Euro ASIC '91\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1991-05-27\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Euro ASIC '91\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/EUASIC.1991.212865\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Euro ASIC '91","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/EUASIC.1991.212865","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

摘要

提出了一种考虑插脚分配时时间约束的方法,插脚分配是平面规划的一个子任务。以前解决球钉分配问题的方法是以各自球网的长度为唯一目标来确定球钉位置或在区块周长上的允许间隔。本文描述了一种层次组合电路的延迟模型,该模型根据时序依赖关系定义了不同全局网络的引脚之间的联系。基于该模型,他们提出了一种松弛优化算法,该算法根据时间要求优化全局网络的引脚位置和路径。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Timing driven pin assignment in a hierarchical design environment
Presents a method for taking into account timing constraints during pin assignment, a subtask of floorplanning. Previous approaches to the pin assignment problem determine pin positions or admissible intervals on the block perimeters with the lengths of the respective nets as the only objective. Th authors describe a delay model for hierarchical combinational circuits which defines a linkage between the pins of different global nets in terms of timing dependencies. Based on this model they propose a slack optimization algorithm, which optimizes pin positions and routes for the global nets with respect to the timing requirements.<>
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术文献互助群
群 号:604180095
Book学术官方微信