通过图案修改优化布局

R. Hojati
{"title":"通过图案修改优化布局","authors":"R. Hojati","doi":"10.1145/123186.123424","DOIUrl":null,"url":null,"abstract":"A new and practical approach to several layout optimization problems is introduced. A novel two-dimensional pattern generator, in connection with a set of routing and placement transformations, is employed to efficiently solve problems ranging from wire crossing minimization and topological via minimization to minimum Steiner tree optimization and IO alignment. The expected running time is O(n log n) and the space requirement is O(n), where n is the number of layout objects. The system was fully coded and tested, and excellent results in both laboratory and real-life examples were achieved.<<ETX>>","PeriodicalId":118552,"journal":{"name":"27th ACM/IEEE Design Automation Conference","volume":"85 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1990-06-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Layout optimization by pattern modification\",\"authors\":\"R. Hojati\",\"doi\":\"10.1145/123186.123424\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A new and practical approach to several layout optimization problems is introduced. A novel two-dimensional pattern generator, in connection with a set of routing and placement transformations, is employed to efficiently solve problems ranging from wire crossing minimization and topological via minimization to minimum Steiner tree optimization and IO alignment. The expected running time is O(n log n) and the space requirement is O(n), where n is the number of layout objects. The system was fully coded and tested, and excellent results in both laboratory and real-life examples were achieved.<<ETX>>\",\"PeriodicalId\":118552,\"journal\":{\"name\":\"27th ACM/IEEE Design Automation Conference\",\"volume\":\"85 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1990-06-24\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"27th ACM/IEEE Design Automation Conference\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/123186.123424\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"27th ACM/IEEE Design Automation Conference","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/123186.123424","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

摘要

介绍了一种新的实用的布局优化方法。采用一种新颖的二维模式生成器,结合一组路由和放置变换,有效地解决了从导线交叉最小化和拓扑通过最小化到最小斯坦纳树优化和IO对齐等问题。预期运行时间为O(n log n),空间需求为O(n),其中n为布局对象的数量。该系统经过了完整的编码和测试,在实验室和现实生活中都取得了良好的结果。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Layout optimization by pattern modification
A new and practical approach to several layout optimization problems is introduced. A novel two-dimensional pattern generator, in connection with a set of routing and placement transformations, is employed to efficiently solve problems ranging from wire crossing minimization and topological via minimization to minimum Steiner tree optimization and IO alignment. The expected running time is O(n log n) and the space requirement is O(n), where n is the number of layout objects. The system was fully coded and tested, and excellent results in both laboratory and real-life examples were achieved.<>
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信