An algorithm for two-layer channel routing
In this paper we show that any two-terminal channel routing problem of density d can be solved in a two-layer grid of width ω=(3/2)d+O(1) by using a model in which two wires are permitted to overlap for not more than a constant distance. This is an asymptotical improvement over the best known result ω=2d−1. The algorithm presented here has the following additional properties: (i) there are at most 6 pairs of over-lapping edges for any two wires produced by it, (ii)it uses 6n contacts, where n is the number of nets to be connected, (iii)it can be implemented to run in time O(n). An extension of the algorithm to the multi-terminal problem is also discussed.
Unable to display preview. Download preview PDF.
- [BBL]Baker, B.S.,S.N.Bhatt and F.T.Leighton: An Approximation Algorithm for manhattan Routing. Proc. 14th STOC, 1983, pp.477–486.Google Scholar
- [BP]Brown, D.J. and F.P.Preparata: Three-Layer Channel Routing of Multi-terminal Nets. Manuscript, Coordinated Science Lab., University of Illions, Oct. 1983.Google Scholar
- [G]Gao,Shaodi: Algorithmen für Channel-routing. Diplomarbeit, FB 10, Universität des saarlandes, July 1984.Google Scholar
- [L]Leighton,F.T.: New Lower Bounds for Channel Routing. Manuscript, Lab. for Computer Science, M.I.T., 1981.Google Scholar
- [PL]Preparata, F.P.and W.Lipski,Jr.: Optimal Three-Layer Channel Routing. Proc. 24th FOCS, 1982.Google Scholar
- [RBM]Rivest,R.T.,A.Baratz and G.L.Miller: Provably Good Channel Routing Algorithms. Proc. CMU Conf. on VLSI, Oct. 1981, pp.153–159.Google Scholar