Optimal Three-Layer Channel Routing
IEEE Transactions on Computers
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
Optimal wiring between rectangles
STOC '81 Proceedings of the thirteenth annual ACM symposium on Theory of computing
DAC '76 Proceedings of the 13th Design Automation Conference
Wire routing by optimizing channel assignment within large apertures
DAC '71 Proceedings of the 8th Design Automation Workshop
STOC '84 Proceedings of the sixteenth annual ACM symposium on Theory of computing
The “PI” (placement and interconnect) system
DAC '82 Proceedings of the 19th Design Automation Conference
Optimal Wiring of Movable Terminals
IEEE Transactions on Computers
Minimizing channel density by lateral shifting of components
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
A parallel algorithm for finding crossing numbers of channel routing (abstract and references only)
CSC '91 Proceedings of the 19th annual conference on Computer Science
| Hi-index | 14.98 |
In the channel routing problem, a problem arising in the design of layout systems, two rows of terminals which are opposite each other, have to be connected. We study what effect the rotation of one row of terminals has on the cost measures of the routing phase. The cost measures we consider are the density, which is proportional to the width of the channel, the crossing number, which is closely related to the number of crossings between two wires in the channel, and the length of nets, which is related to the wire length needed in the routing. We present algorithms for determining the rotations which minimize each of these cost measures. The algorithms can also be used for solving optimal offset problems.