Introduction to VLSI Systems
Optimal wiring between rectangles
STOC '81 Proceedings of the thirteenth annual ACM symposium on Theory of computing
An optimum channel-routing algorithm for polycell layouts of integrated circuits
DAC '73 Proceedings of the 10th Design Automation Workshop
An optimal solution to a wire-routing problem (preliminary version)
STOC '80 Proceedings of the twelfth 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
DAC '82 Proceedings of the 19th Design Automation Conference
The “PI” (placement and interconnect) system
DAC '82 Proceedings of the 19th Design Automation Conference
On routing two-point nets across a channel
DAC '82 Proceedings of the 19th Design Automation Conference
The minimum width routing of A 2-row 2-layer polycell-layout
DAC '79 Proceedings of the 16th Design Automation Conference
Novel routing schemes for IC layout part I: Two-layer channel routing
DAC '91 Proceedings of the 28th ACM/IEEE Design Automation Conference
Channel routing of multiterminal nets
SFCS '87 Proceedings of the 28th Annual Symposium on Foundations of Computer Science
Algorithms for permutation channel routing
Integration, the VLSI Journal
| Hi-index | 0.00 |
A linear-time approximation algorithm for routing multipoint net channels is presented. The algorithm uses at most a constant factor times the optimal number of tracks required. The notion of channel fluxis introduced and shown, like channel density, to be a lower bound for channel width. Every multipoint net channel having density d and flux f is routed within 2d+O(f) tracks, and every two-point net channel within d+O(f) tracks. Since the flux never exceeds &thgr;(@@@@n), this proves a conjecture of Brown and Rivest [6] that every n-net channel can be routed in O(d+@@@@n) tracks. In practice, it appears that the flux never exceeds a small constant. In this case the algorithm performs asymptotically better than the best-known knock-knee algorithm [21], and almost as well as the best-known three-layer algorithm [19], without requiring the use of either knock-knees or three layers of interconnect. In addition, the three-parameter model, which is closer to the design rules of current fabrication technologies, is presented. Under this model, it is shown that every channel can be routed using 2d+O(1) tracks.