{"title":"改进了信道边界上的端口分配","authors":"E. Levin","doi":"10.1109/EDAC.1992.205949","DOIUrl":null,"url":null,"abstract":"Deals with the task of assigning the crossing of nets on channel boundaries in the layout integration of macro cells. The author's approach to this problem targets both global criteria (overall area, net lengths) and local criteria (improved channel routability). This is done in a two-stage algorithm. In the first stage, all global needs are captured. In the second, all conflicting needs are resolved while taking the specific channel and channel router needs into account. The algorithm is part of Laysys, a layout integration system which was used for the design of the Swordfish ULSI microprocessor.<<ETX>>","PeriodicalId":285019,"journal":{"name":"[1992] Proceedings The European Conference on Design Automation","volume":"16 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1992-03-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Improved port assignment on channel boundaries\",\"authors\":\"E. Levin\",\"doi\":\"10.1109/EDAC.1992.205949\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Deals with the task of assigning the crossing of nets on channel boundaries in the layout integration of macro cells. The author's approach to this problem targets both global criteria (overall area, net lengths) and local criteria (improved channel routability). This is done in a two-stage algorithm. In the first stage, all global needs are captured. In the second, all conflicting needs are resolved while taking the specific channel and channel router needs into account. The algorithm is part of Laysys, a layout integration system which was used for the design of the Swordfish ULSI microprocessor.<<ETX>>\",\"PeriodicalId\":285019,\"journal\":{\"name\":\"[1992] Proceedings The European Conference on Design Automation\",\"volume\":\"16 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1992-03-16\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"[1992] Proceedings The European Conference on Design Automation\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/EDAC.1992.205949\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"[1992] Proceedings The European Conference on Design Automation","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/EDAC.1992.205949","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Deals with the task of assigning the crossing of nets on channel boundaries in the layout integration of macro cells. The author's approach to this problem targets both global criteria (overall area, net lengths) and local criteria (improved channel routability). This is done in a two-stage algorithm. In the first stage, all global needs are captured. In the second, all conflicting needs are resolved while taking the specific channel and channel router needs into account. The algorithm is part of Laysys, a layout integration system which was used for the design of the Swordfish ULSI microprocessor.<>
![[1992] Proceedings The European Conference on Design Automation](/Content/css/sci/img/zetp.jpg)
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
