Provably Good Parallel Algorithms for Channel Routing of Multi- terminal Nets.
| dc.contributor.author | Krishnamurthy, Sridhar | en_US |
| dc.contributor.author | JaJa, Joseph F. | en_US |
| dc.contributor.department | ISR | en_US |
| dc.date.accessioned | 2007-05-23T09:41:29Z | |
| dc.date.available | 2007-05-23T09:41:29Z | |
| dc.date.issued | 1988 | en_US |
| dc.description.abstract | We consider the channel routing problem of a set of multi- terminal nets in the knockknee model. We develop a new approach to route all the nets within d + ALPHA tracks, where d is the channel density, and 0 < ALPHA < d, such that the corresponding layout can be realized with three layers. Both the routing and the layer assignment algorithms have linear time sequential implementations. In addition both can be implemented on the CREW- PRAM model in O( n/p + log n) time, with p processors, 1 < p < n and n is the size of the input. | en_US |
| dc.format.extent | 645760 bytes | |
| dc.format.mimetype | application/pdf | |
| dc.identifier.uri | http://hdl.handle.net/1903/4780 | |
| dc.language.iso | en_US | en_US |
| dc.relation.ispartofseries | ISR; TR 1988-51 | en_US |
| dc.title | Provably Good Parallel Algorithms for Channel Routing of Multi- terminal Nets. | en_US |
| dc.type | Technical Report | en_US |
Files
Original bundle
1 - 1 of 1