{"title":"Parallel algorithm for wiring two-terminal nets in the knock-knee mode","authors":"H. Kimm","doi":"10.1109/SSST.1996.493538","DOIUrl":null,"url":null,"abstract":"In this paper, the problem of stretching a layout in the knock-knee mode is represented while considering its wirability. The previous O(n/spl times/m) time serial algorithm for this problem which is bared on two layers needs (2m-1)/spl times/n layout area in the worst case, where m=number of rows and n number of columns. However, O(n log n) time serial algorithm that is able to wire all the two-terminal nets within (m/spl times/3n/2) layout area is given in the paper. This serial algorithm is applied to generate a parallel CREW PRAM algorithm that can wire all the nets in O(log n) time by using O(n) number of processors.","PeriodicalId":135973,"journal":{"name":"Proceedings of 28th Southeastern Symposium on System Theory","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"1996-03-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of 28th Southeastern Symposium on System Theory","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SSST.1996.493538","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
Abstract
In this paper, the problem of stretching a layout in the knock-knee mode is represented while considering its wirability. The previous O(n/spl times/m) time serial algorithm for this problem which is bared on two layers needs (2m-1)/spl times/n layout area in the worst case, where m=number of rows and n number of columns. However, O(n log n) time serial algorithm that is able to wire all the two-terminal nets within (m/spl times/3n/2) layout area is given in the paper. This serial algorithm is applied to generate a parallel CREW PRAM algorithm that can wire all the nets in O(log n) time by using O(n) number of processors.