Advertisement

On the complexity of single row routing problems

  • Adair Dingle
  • I. Hal Sudborough
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 382)

Abstract

We consider single row routing problems in VLSI. Previous work has left open, for all k≥3, whether or not there is an efficient algorithm to route interconnections on the minimum number of layers when only k channels are permitted per layer. We show that deciding whether such a routing exists is NP-complete even when k=3 and the interconnections are 2-pin nets. This solves an important open problem often cited in the literature. We also improve the running times of previously described algorithms for obtaining optimal single row routings by showing how to eliminate several paths in exhaustive search. Although this result still yields an exponential time algorithm (which presumably is necessary, as the problem is NP-complete), it solves routings instances with more channels than could be handled before.

Keywords

IEEE Transaction HAMILTONIAN Path Parallel Track Important Open Problem Lower Street 
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. [An]
    L. Andersen, "On Single-Row Routing", IEEE Transactions on Circuits and Systems, vol CAS-27, no. 12, Dec. 1980, pp. 1262–1263.CrossRefGoogle Scholar
  2. [Ar]
    P. Arnold, "Complexity Results for Circuit Layout on Double-sided printed circuit boards", Bachelor's thesis, Harvard University, 1982.Google Scholar
  3. [DS]
    A. Dingle and H. Sudborough, "Single Row Routing Revisited", manuscript, University of Texas at Dallas, January 1989.Google Scholar
  4. [GJ]
    M. Garey and S. Johnson, Computers and Intractability, San Francisco, CA: Freeman, 1979, p. 199.Google Scholar
  5. [GK]
    T. F. Gonzalez and S. Kurki-Gowdara, "Minimization of the Number of Layers for Single Row Routing with Fixed Street Capacity", IEEE Trans. Computer-Aided Design, vol 7, no. 3, March 1988, pp. 420–424.CrossRefGoogle Scholar
  6. [HS84]
    S. Han, and S. Sahni, "Single-Row Routing in Narrow Streets", IEEE Transactions on Computer-Aided Design, vol CAD-3, no. 3, July 1984, pp. 235–241.Google Scholar
  7. [HS85]
    S. Han, and S. Sahni, "Layering Algorithms for Single Row Routing", in Proc. 22nd Design Automation Conf., 1985, pp. 516–522.Google Scholar
  8. [KKF]
    E. Kuh, T. Kashiwabara, and T. Fujisawa, "On Optimum Single-Row Routing", IEEE Transactions on Circuits and Systems, vol CAS-26, no. 6, June 1979, pp. 209–216.Google Scholar
  9. [MT]
    M. Marek-Sadowska and T. Tarng, "Single-Layer Routing for VLSI: Analysis and Algorithms", IEEE Transactions on Computer-Aided Design, vol CAD-2, no. 4, Oct 1983, pp. 246–259.Google Scholar
  10. [RS]
    R. Raghavan and S. Sahni, "Single Row Routing", IEEE Transactions on Computers, vol C-32, no. 3, March 1983, pp. 209–220.Google Scholar
  11. [Ri]
    D. Richards, "Complexity of Single-Layer Routing", IEEE Trans. Computers, vol C-33, no. 3, March 1984, pp. 286–288.Google Scholar
  12. [SBR]
    S. Sahni, A. Bhatt, and R. Raghavan, "The complexity of design automation problems", in Proc. 17th Design Automation Conf., 1980, pp. 402–411.Google Scholar
  13. [TKS76]
    B. Ting, E. S. Kuh, and I. Shirakawa, "The Multilayer Routing Problem: Algorithms and Necessary and Sufficient Conditions for the Single-Row Single-Layer Case", IEEE Transactions on Circuits and Systems, vol CAS-23, no. 12, Dec 1976, pp. 768–778.Google Scholar
  14. [TKS80]
    S. Tsukiyama, E. S. Kuh, and I. Shirakawa, "An Algorithm for Single-Row Routing with Prescribed Street Congestions", IEEE Transactions on Circuits and Systems, vol CAS-27, no. 9, Sept. 1980, pp. 765–772.Google Scholar
  15. [TKS83]
    S. Tsukiyama, E. S. Kuh, and I. Shirakawa, "On the layering problem on multilayer PWB wiring", IEEE Trans. Computer-Aided Design, vol CAD-2, pp. 30–38, Jan 1983.Google Scholar
  16. [TMK]
    T. Tarng, M. Marek-Sadowska, and E. Kuh, "An Efficient Single-Row Routing Algorithm", IEEE Transactions on Computer-Aided Design, vol CAD-3, no. 3, July 1984, pp. 178–183.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1989

Authors and Affiliations

  • Adair Dingle
    • 1
  • I. Hal Sudborough
    • 1
  1. 1.Computer Science ProgramUniversity of Texas at DallasRichardson

Personalised recommendations