Show simple item record

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

dc.contributor.authorKrishnamurthy, Sridharen_US
dc.contributor.authorJaJa, Joseph F.en_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.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 in this item


This item appears in the following Collection(s)

Show simple item record