Parallel Algorithms for Channel Routing in the KnockKnee Model.

Simple item page
dc.contributor.authorChang, Shin-Chongen_US
dc.contributor.authorJaJa, Joseph F.en_US
dc.contributor.departmentISRen_US
dc.date.accessioned2007-05-23T09:41:01Z
dc.date.available2007-05-23T09:41:01Z
dc.date.issued1988en_US
dc.description.abstractWe 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.extent751353 bytes
dc.format.mimetypeapplication/pdf
dc.identifier.urihttp://hdl.handle.net/1903/4756
dc.language.isoen_USen_US
dc.relation.ispartofseriesISR; TR 1988-24en_US
dc.titleParallel Algorithms for Channel Routing in the KnockKnee Model.en_US
dc.typeTechnical Reporten_US

Files

Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
TR_88-24.pdf
Size:
733.74 KB
Format:
Adobe Portable Document Format
Download

Collections

Institute for Systems Research Technical Reports