Skip to main content
SpringerLink
Log in

Switchbox routing in VLSI design: Closing the complexity gap

Extended abstract

  • Conference paper
  • First Online:
Graph-Theoretic Concepts in Computer Science (WG 1996)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1197))

Included in the following conference series:

Abstract

The design of integrated circuits has achieved a great deal of attention in the last decade. In the routing phase, there have survived two open layout problems which are important from both the theoretical and the practical point of view. Up to now, switchbox routing has been known to be solvable in polynomial time when there are only 2-terminal nets, and to be NP-complete in case there exist nets involving at least five terminals. Our main result is that this problem is NP-complete even if no net has more than three terminals. Hence, from the theoretical perspective, the switchbox routing problem is completely settled.

The NP-completeness proof is based on a reduction from a special kind of the satisfiability problem. It is also possible to adopt our construction to channel routing which shows that this problem is NP-complete, even if each net does not consist of more than four terminals. This improves upon a result of Sarrafzadeh who showed the NP-completeness in case of nets with no more than five terminals.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. M. Formann, D. Wagner, and F. Wagner. Routing through a dense channel with minimum total wire length. Journal of Algorithms, 15:267–283, 1993.

    Google Scholar 

  2. M. R. Garey and D. S. Johnson. Computers and Intractability — A Guide to the Theory of NP-Completeness. W. H. Freeman and Company, New York, 1979.

    Google Scholar 

  3. M. Grötschel, A. Martin, and R. Weismantel. Routing in grid graphs by cutting planes. In G. Rinaldi and L. Wolsey, editors, Third IPCO Conference, pages 447–461, 1993.

    Google Scholar 

  4. S. Hartmann. Channel routing with 4-terminal nets is NP-complete. Preprint, Fachbereich Mathematik, Technische Universität Berlin, Berlin, Germany, 1996.

    Google Scholar 

  5. B. Korte, H.-J. Prömel, and A. Steger. Steiner trees in VLSI-layout. In B. Korte, L. Lovasz, H. J. Prömel, and A. Schrijver, editors, Paths, Flows and VLSI-Layout, pages 185–214. Springer Verlag, 1990.

    Google Scholar 

  6. M. R. Kramer and J. van Leeuwen. The complexity of wire routing and finding minimum area layouts for arbitrary VLSI circuits. In F. P. Preparata, editor, Advances in Computing Research, Vol. 2 VLSI theory, pages 129–146. JAI Press, Reading, MA, 1984.

    Google Scholar 

  7. Th. Lengauer. Combinatorical Algorithms for Integrated Circuit Layout. Teubner/Wiley&Sons, 1990.

    Google Scholar 

  8. M. Middendorf. Manhattan channel routing is \(\mathcal{N}\mathcal{P}\)-complete under truly restricted settings. Preprint, Universität Karlruhe, 1993. To appear in the Chicago Journal of Theoretical Computer Science.

    Google Scholar 

  9. K. Mehlhorn and F. P. Preparata. Routing through a rectangle. Journal of the Association for Computing Machinery, 33(1):60–85, 1986.

    Google Scholar 

  10. M. Marek-Sadowska. Switch box routing: a retrospective. Integration, the VLSI Journal, 13:39–65, 1992.

    Google Scholar 

  11. R. H. Möhring, D. Wagner, and F. Wagner. Network Routing, chapter VLSI Network Design, pages 625–712. Handbooks in Operations Research and Management Science. Elsevier, 1995.

    Google Scholar 

  12. H. Okamura and P. D. Seymour. Multicommodity flows in planar graphs. Journal of Computer Theory, pages 75–81, 1981.

    Google Scholar 

  13. M. Sarrafzadeh. Channel-routing problem in the knock-knee mode is NP-complete. IEEE Transaction on Computer-Aided Design, 6(4):503–506, 1987.

    Google Scholar 

  14. T. G. Szymanski. Dogleg channel-routing is NP-complete. IEEE Transaction on Computer-Aided Design, 4(1):31–41, 1985.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Fachbereich Mathematik (MA 6-1), Technische Universität Berlin, Stra\e des 17. Juni 136, D-10623, Berlin, Germany

    Stephan Hartmann, Markus W. Schäffter & Andreas S. Schulz

Authors
  1. Stephan Hartmann
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Markus W. Schäffter
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Andreas S. Schulz
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Fabrizio d'Amore Paolo Giulio Franciosa Alberto Marchetti-Spaccamela

Rights and permissions

Reprints and permissions

Copyright information

© 1997 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Hartmann, S., Schäffter, M.W., Schulz, A.S. (1997). Switchbox routing in VLSI design: Closing the complexity gap. In: d'Amore, F., Franciosa, P.G., Marchetti-Spaccamela, A. (eds) Graph-Theoretic Concepts in Computer Science. WG 1996. Lecture Notes in Computer Science, vol 1197. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-62559-3_17

Download citation

  • DOI: https://doi.org/10.1007/3-540-62559-3_17

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-62559-9

  • Online ISBN: 978-3-540-68072-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation