Parallel Algorithms for Channel Routing in the KnockKnee Model.
dc.contributor.author | Chang, Shin-Chong | en_US |
dc.contributor.author | JaJa, Joseph F. | en_US |
dc.contributor.department | ISR | en_US |
dc.date.accessioned | 2007-05-23T09:41:01Z | |
dc.date.available | 2007-05-23T09:41:01Z | |
dc.date.issued | 1988 | en_US |
dc.description.abstract | We consider the channel routing problem of a set of two-terminal nets in the knockknee model. The known strategy to handle this problem seems to beinherently sequential. We develop a new approach to route all the nets within d tracks, where d is the density, such that the corresponding layout can be realized with three layers. Both the routing and layer assignment algorithms can be implemented on the CREW-PRAM model in O(log n) time with O(n) processors, where n is the number of nets. | en_US |
dc.format.extent | 751353 bytes | |
dc.format.mimetype | application/pdf | |
dc.identifier.uri | http://hdl.handle.net/1903/4756 | |
dc.language.iso | en_US | en_US |
dc.relation.ispartofseries | ISR; TR 1988-24 | en_US |
dc.title | Parallel Algorithms for Channel Routing in the KnockKnee Model. | en_US |
dc.type | Technical Report | en_US |
Files
Original bundle
1 - 1 of 1