Provably Good Parallel Algorithms for Channel Routing of Multi- terminal Nets.

dc.contributor.authorKrishnamurthy, Sridharen_US
dc.contributor.authorJaJa, Joseph F.en_US
dc.contributor.departmentISRen_US
dc.date.accessioned2007-05-23T09:41:29Z
dc.date.available2007-05-23T09:41:29Z
dc.date.issued1988en_US
dc.description.abstractWe 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.extent645760 bytes
dc.format.mimetypeapplication/pdf
dc.identifier.urihttp://hdl.handle.net/1903/4780
dc.language.isoen_USen_US
dc.relation.ispartofseriesISR; TR 1988-51en_US
dc.titleProvably Good Parallel Algorithms for Channel Routing of Multi- terminal Nets.en_US
dc.typeTechnical Reporten_US

Files

Original bundle
Now showing 1 - 1 of 1
Loading...
Thumbnail Image
Name:
TR_88-51.pdf
Size:
630.63 KB
Format:
Adobe Portable Document Format