A 4d channel router for a two layer diagonal model
We consider a variation of the channel routing model called diagonal model (DM), where the connections are laid in two layers, along tracks at +45° (first layer) and −45° (second layer). Based on some theoretical results, we present an algorithm that solves any two-terminal routing problem in DM, in a channel of width 4d. No similar result is known in the Manhattan model, where the best algorithm completely analyzed attains a channel width of d+O(f), f≤ √n.
Unable to display preview. Download preview PDF.
- Hu T.C., Kuh E.S. Theory and Concepts of Circuits Layout. In T.C. Hu and K.S. Kuh, Eds.: VLSI Circuit Layout: Theory and Design, IEEE Press Selected Rep. Series, New York 1985.Google Scholar
- Leighton T. A Survey of Problems and Results for Channel Routing, A.W.O.C., Loutraki, Greece, July 1986.Google Scholar
- Preparata F.P., Lipski W. Optimal Three-layer Wireable Layouts, IEEE Trans. on Comp. C-33 (1984), 427–437.Google Scholar
- Sarrafzadeh M. Hierarchical Approaches to VLSI Circuit Layout, Coordinated Science Lab., Univ. of Illinois, Tech. Rep. ACT 72, 1986.Google Scholar
- Brown D. and Rivest R. L. New Lower Bounds on Channel Width, Proc. CMU Conference on VLSI Systems and Computations, Computer Science Press 1981, 178–185.Google Scholar
- Lodi E., Luccio F. and Pagli L. A preliminary study of a Diagonal Channel Routing Model, Algorithmica, to appear.Google Scholar
- Baker B.S., Bhatt S.N., Leighton T. An Approximation Algorithm for Manhattan Routing, in F.P.Preparata, Ed., Advances in Computing Research, Vol.2, JAI Press 1984.Google Scholar
- Rivest R.L., Baratz A.E. and Miller G. Provably good channel routing algorithms, Proc. CMU Conference on VLSI Systems and computations, 1981.Google Scholar
- Lodi E., Luccio F. and Pagli L. Channel Routing in the Diagonal Model, Dipartimento di Informatica, Univ. of Pisa, Int. Rep. 1988.Google Scholar
- Lodi E. Routing Multiterminal Nets in a Diagonal Model, Proc. 22nd CISS, Princeton 1988.Google Scholar