Unconstrained multilayer switchbox routing
- 46 Downloads
Consider the gradually more and more complexproblems of single row routing, channel routing and switchbox routing on the one hand, and the gradually less and less restrictivemodels (1-layer, Manhattan, unconstrained 2-layer, multilayer) on the other hand. The single row routing problems can always be solved in the Manhattan model, and the channel routing problem can always be solved in the unconstrained 2-layer model, in fact, both in linear time. In this paper, we show that the switchbox routing problem is solvable in the multilayer model, also in linear time.
KeywordsLinear Time Multilayer Model Manhattan Model
Unable to display preview. Download preview PDF.
- M.L. Brady and D.J. Brown, VLSI routing: Four layers suffice, in:Advances in Computing Research, Vol. 2:VLSI Theory, ed. F.P. Preparata (JAI Press, Greenwich, CT, 1984) pp. 245–258.Google Scholar
- M. Forman and F. Wagner, The VLSI layout problem on various embedding models, in:Proc. 16th Int. Workshop on Graph-Theoretic Concepts in Computer Science WG '90, ed. R.H. Möhring, Lecture Notes in Computer Science 484 (Springer, 1990) pp. 130–139.Google Scholar
- S.E. Hambrusch, Channel routing in overlap models, IEEE Trans Comp.-Aided Design ICs Syst. CAD-4(1985)23–30.Google Scholar
- D.S. Johnson, The NP-completeness column: An ongoing guide, J. Algor. 5(1984)147–160.Google Scholar
- T. Lengauer,Combinatorial Algorithms for Integrated Circuit Layout (Teubner, Stuttgart-Wiley, Chichester, 1990).Google Scholar
- W. Lipski, Jr., On the structure of three-layer wirable layouts, in:Advances in Computing Research, Vol. 2:VLSI Theory, ed. F.P. Preparata (JAI Press, Greenwich, CT, 1984) pp. 231–244.Google Scholar
- M. Marek-Sadowska and E. Kuh, General channel-routing algorithm, Proc. IEE (GB) 130 G 3 (1983) 83–88.Google Scholar
- H. Mueller and D.A. Mlynski, Automatic multilayer routing for surface mounted technology,Proc. IEEE Int. Symp. Circuits and Systems, Espoo, Finland (1988) pp. 2189–2192.Google Scholar
- A. Recski, Minimax results and polynomial algorithms in VLSI routing, in:Combinatorics, Graphs, Complexity, ed. M. Fiedler and J. Nesetril (Prachatice, 1992) pp. 261–273.Google Scholar
- A. Recski and F. Strzyzewski, Vertex-disjoint channel routing on two layers, in:Integer Programming and Combinatorial Optimization, ed. R. Kannan and W. Pulleyblank (Waterloo, 1990) pp. 297–405.Google Scholar