{"title":"标准小区设计中超小区路由的一般模型和算法","authors":"J. Cong, B. Preas, C. Liu","doi":"10.1109/DAC.1990.114945","DOIUrl":null,"url":null,"abstract":"When an over-the-cell routing layer is available for a VLSI standard cell layout, efficient utilization of routing space over the cells can significantly reduce layout area. Three physical models are presented to utilize the area over the cells for routing in standard cell designs. Also presented are efficient algorithms to choose and to route a planar subset of nets over the cells so that the resulting channel density is reduced as much as possible. For each of the physical models, it is shown how to arrange inter-cell routing, over-the-cell routing and power/ground buses to achieve valid routing solutions. Each algorithm exploits the particular arrangement in the corresponding physical model and produces provably good results in polynomial time. The saving in routing area achieved by these algorithms is up to 21 %.<<ETX>>","PeriodicalId":118552,"journal":{"name":"27th ACM/IEEE Design Automation Conference","volume":"79 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1990-06-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"54","resultStr":"{\"title\":\"General models and algorithms for over-the-cell routing in standard cell design\",\"authors\":\"J. Cong, B. Preas, C. Liu\",\"doi\":\"10.1109/DAC.1990.114945\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"When an over-the-cell routing layer is available for a VLSI standard cell layout, efficient utilization of routing space over the cells can significantly reduce layout area. Three physical models are presented to utilize the area over the cells for routing in standard cell designs. Also presented are efficient algorithms to choose and to route a planar subset of nets over the cells so that the resulting channel density is reduced as much as possible. For each of the physical models, it is shown how to arrange inter-cell routing, over-the-cell routing and power/ground buses to achieve valid routing solutions. Each algorithm exploits the particular arrangement in the corresponding physical model and produces provably good results in polynomial time. The saving in routing area achieved by these algorithms is up to 21 %.<<ETX>>\",\"PeriodicalId\":118552,\"journal\":{\"name\":\"27th ACM/IEEE Design Automation Conference\",\"volume\":\"79 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1990-06-24\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"54\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"27th ACM/IEEE Design Automation Conference\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/DAC.1990.114945\",\"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.1109/DAC.1990.114945","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
General models and algorithms for over-the-cell routing in standard cell design
When an over-the-cell routing layer is available for a VLSI standard cell layout, efficient utilization of routing space over the cells can significantly reduce layout area. Three physical models are presented to utilize the area over the cells for routing in standard cell designs. Also presented are efficient algorithms to choose and to route a planar subset of nets over the cells so that the resulting channel density is reduced as much as possible. For each of the physical models, it is shown how to arrange inter-cell routing, over-the-cell routing and power/ground buses to achieve valid routing solutions. Each algorithm exploits the particular arrangement in the corresponding physical model and produces provably good results in polynomial time. The saving in routing area achieved by these algorithms is up to 21 %.<>