Sivakumaran Natarajan, N. Sherwani, N. D. Holmes, M. Sarrafzadeh
{"title":"用于高性能电路的蜂窝通道路由","authors":"Sivakumaran Natarajan, N. Sherwani, N. D. Holmes, M. Sarrafzadeh","doi":"10.1109/DAC.1992.227815","DOIUrl":null,"url":null,"abstract":"The authors present a new three-layer over-the-cell channel routing algorithm, WILMA3 (wire length minimization algorithm 3), for high-performance circuits. This router not only minimizes the channel height by OTC routing but also minimizes the net lengths. They have also developed a two-layer router, WILMA2. Both WILMA2 and WILMA3 achieve reduction in channel height while maintaining the net length greater than its length in the two-layer channel routing. Experimental results with WILMA2 indicated that WILMA2 can produce routings that are comparable to existing two-layer over-the-cell routers. Both WILMA2 and WILMA3 achieved these results, while maintaining the net length bound.<<ETX>>","PeriodicalId":162648,"journal":{"name":"[1992] Proceedings 29th ACM/IEEE Design Automation Conference","volume":"138 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1992-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"30","resultStr":"{\"title\":\"Over-the-cell channel routing for high performance circuits\",\"authors\":\"Sivakumaran Natarajan, N. Sherwani, N. D. Holmes, M. Sarrafzadeh\",\"doi\":\"10.1109/DAC.1992.227815\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The authors present a new three-layer over-the-cell channel routing algorithm, WILMA3 (wire length minimization algorithm 3), for high-performance circuits. This router not only minimizes the channel height by OTC routing but also minimizes the net lengths. They have also developed a two-layer router, WILMA2. Both WILMA2 and WILMA3 achieve reduction in channel height while maintaining the net length greater than its length in the two-layer channel routing. Experimental results with WILMA2 indicated that WILMA2 can produce routings that are comparable to existing two-layer over-the-cell routers. Both WILMA2 and WILMA3 achieved these results, while maintaining the net length bound.<<ETX>>\",\"PeriodicalId\":162648,\"journal\":{\"name\":\"[1992] Proceedings 29th ACM/IEEE Design Automation Conference\",\"volume\":\"138 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1992-07-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"30\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"[1992] Proceedings 29th ACM/IEEE Design Automation Conference\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/DAC.1992.227815\",\"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 29th ACM/IEEE Design Automation Conference","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/DAC.1992.227815","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Over-the-cell channel routing for high performance circuits
The authors present a new three-layer over-the-cell channel routing algorithm, WILMA3 (wire length minimization algorithm 3), for high-performance circuits. This router not only minimizes the channel height by OTC routing but also minimizes the net lengths. They have also developed a two-layer router, WILMA2. Both WILMA2 and WILMA3 achieve reduction in channel height while maintaining the net length greater than its length in the two-layer channel routing. Experimental results with WILMA2 indicated that WILMA2 can produce routings that are comparable to existing two-layer over-the-cell routers. Both WILMA2 and WILMA3 achieved these results, while maintaining the net length bound.<>