Abstract
In this paper we present three new two-layer channel routing algorithms that are provably good in that they never require more than 2d-1 horizontal tracks where d is the channel density, when each net connects just two terminals. To achieve this result, we use a slightly relaxed (but still realistic) wiring model in which wires may run on top of each other for short distances as long as they are on different layers. Two of our algorithms will never use such a “parallel run” of length greater than 2d-1 and our third algorithm will require overlap only at jog points or cross points. Since in this wiring model at least d/2 horizontal tracks are required, these algorithms produce a routing requiring no more than four times the best possible number of horizontal tracks. The second algorithm also has the property that it uses uses at most 4n contacts, where n is the number of nets being connected.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Deutsch, D.N., “A Dogleg Channel Router,” Proceedings of the 13th IEEE Design Automation Conference (1976), 425–433.
Dolev, D.; Karplus, K.; Siegel. A.; Strong, A. and Ullman, J.D., “Optimal Wiring Between Rcctangles, ” 13th Annual ACM Stoc Proceedings (Milwaukee, 1981), 312–317
Hashimoto, A. and Stevens, J., “Wire Routing By Optimizing Channel Assignment Within Large Apertures,” Proceedings of the 8th IEEE Design Automation Workshop (1971), 155–169.
Tompa, M., “An Optimal Solution to a Wire-routing Problem,” 12th Annual ACM Stoc Proceedings (Los Angeles, 1980), 161–176.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1981 Carnegie-Mellon University
About this chapter
Cite this chapter
Rivest, R.L., Baratz, A.E., Miller, G. (1981). Provably Good Channel Routing Algorithms. In: Kung, H.T., Sproull, B., Steele, G. (eds) VLSI Systems and Computations. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-68402-9_18
Download citation
DOI: https://doi.org/10.1007/978-3-642-68402-9_18
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-68404-3
Online ISBN: 978-3-642-68402-9
eBook Packages: Springer Book Archive