An optimal channel-routing algorithm for a restricted class of multi-terminal nets
We are given a channel-routing problem in which all nets have either (1) all their terminals on the same side of the channel, or (2) all but their rightmost terminal on the same side. This is the only class of multi-terminal nets for which an optimal algorithm has been found. Our paper describes an algorithm that routes the channel in knock-knee mode using D tracks, where D is the channel density and is a trivial lower-bound for channel width. Our implementation has complexity O(nlog2 D), where n is the number of columns in the channel.
KeywordsLocal Density Restricted Class Channel Density Proper Order Track Number
Unable to display preview. Download preview PDF.
- 1.M. L. Brady and D. J. Brown, “VLSI routing: Four layers suffice,” Advances in Computing Research, vol. 2, pp. 245–257, JAI Press, Inc., 1984.Google Scholar
- 2.K. Mehlhorn, F. P. Preparata, and M. Sarrafzadeh, “Channel routing in knock-knee mode: Simplified Algorithms and Proofs,” Algorithmica, pp. 213–221, 1986.Google Scholar
- 3.F. P. Preparata and W. Lipski, Jr., “Optimal three-layer channel routing,” IEEE Transactions on Computers, vol. C-33, no. 5, pp. 427–437.Google Scholar
- 4.R. L. Rivest, A. E. Baratz, and G. Miller, “Provably good channel routing algorithms,” Proceedings CMU Conference on VLSI Systems and Computations, pp. 151–159, October, 1981.Google Scholar