Advertisement

Annals of Operations Research

, Volume 58, Issue 7, pp 481–491 | Cite as

Unconstrained multilayer switchbox routing

  • Endre Boros
  • András Recski
  • Ferenc Wettl
Scheduling and Routing

Abstract

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.

Keywords

Linear Time Multilayer Model Manhattan Model 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    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
  2. [2]
    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
  3. [3]
    S.E. Hambrusch, Channel routing in overlap models, IEEE Trans Comp.-Aided Design ICs Syst. CAD-4(1985)23–30.Google Scholar
  4. [4]
    D.S. Johnson, The NP-completeness column: An ongoing guide, J. Algor. 5(1984)147–160.Google Scholar
  5. [5]
    T. Lengauer,Combinatorial Algorithms for Integrated Circuit Layout (Teubner, Stuttgart-Wiley, Chichester, 1990).Google Scholar
  6. [6]
    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
  7. [7]
    M. Marek-Sadowska and E. Kuh, General channel-routing algorithm, Proc. IEE (GB) 130 G 3 (1983) 83–88.Google Scholar
  8. [8]
    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
  9. [9]
    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
  10. [10]
    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

Copyright information

© J.C. Baltzer AG, Science Publishers 1995

Authors and Affiliations

  • Endre Boros
    • 1
  • András Recski
    • 2
  • Ferenc Wettl
    • 3
  1. 1.RUTCOR, Rutgers UniversityNew BrunswickUSA
  2. 2.Department of Mathematics, Faculty of Electrical Engineering and InformaticsTechnical University of BudapestBudapestHungary
  3. 3.Department of Mathematics, Faculty of Transportation EngineeringTechnical University of BudapestBudapestHungary

Personalised recommendations