Optimal Three-Layer Channel Routing
IEEE Transactions on Computers
Stretching a Knock-Knee Layout for Multilayer Wiring
IEEE Transactions on Computers
Routing through a dense channel with minimum total wire length
SODA '91 Proceedings of the second annual ACM-SIAM symposium on Discrete algorithms
An animated library of combinatorial VLSI-routing algorithms
Proceedings of the eleventh annual symposium on Computational geometry
Efficient algorithms for finding disjoint paths in grids
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Wiring Knock-Knee Layouts: A Global Approach
IEEE Transactions on Computers
Edge-Disjoint Routing in Plane Switch Graphs in Linear Time
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Edge-disjoint routing in plane switch graphs in linear time
Journal of the ACM (JACM)
| Hi-index | 0.01 |
In this paper an O(N log N) algorithm for routing through a rectangle is presented. Consider an n-by-m rectangular grid and a set of N two-terminal nets. A net is a pair of points on the boundary of the rectangle. A layout is a set of edge-disjoint paths, one for each net. Our algorithm constructs a layout, if there is one, in O(N log N) time; this contrasts favorably with the area of the layout that might be as large as N2. The layout constructed can be wired using four layers of interconnect with only O(N) contact cuts. A partial extension to multiterminal nets is also discussed.