Skip to main content
SpringerLink
Log in

3—Dimensional Single Active Layer Routing

  • Conference paper
  • First Online:
Discrete and Computational Geometry (JCDCG 2000)

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

Included in the following conference series:

Abstract

Suppose that the terminals to be interconnected are situated in a rectangular area of length n and width w and the routing should be realized in a box of size w′ × n′ over this rectangle (single active layer routing) where w′ = cw and n ≤ n′ ≤ n + 1. We prove that it is always possible with height h = O(n) and in time t = O(n) for a fixed w and both estimates are best possible (as far as the order of magnitude of n is concerned). The more theoretical case when the terminals are situated in two opposite parallel planes of the box (the 3-dimensional analogue of channel routing) is also studied.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Aggarwal, A., M. Klawe, D. Lichtenstein, N. Linial, and A. Wigderson, 1991. A lower bound on the area of permutation layouts, Algorithmica 6, 241–255.

    Article  MATH  MathSciNet  Google Scholar 

  2. Aggarwal, A., J. Kleinberg, and D. P. Williamson, 2000. Node-disjoint paths on the mesh and a new trade-off in VLSI layout, SIAM J. Computing 29, 1321–1333.

    Article  MATH  MathSciNet  Google Scholar 

  3. Baker S. B., S. N. Bhatt, and F. T. Leighton, 1984. An approximation algorithm for Manhattan routing, Advances in Computing Research 2, 205–229.

    Google Scholar 

  4. Boros, E., A. Recski and F. Wettl, 1995. Unconstrained multilayer switchbox routing, Ann. Oper. Res. 58, 481–491.

    Article  MATH  MathSciNet  Google Scholar 

  5. Burstein, M. and R. Pelavin, 1983. Hierarchical wire routing, IEEE Trans. Computer-Aided Design CAD-2, 223–234.

    Article  Google Scholar 

  6. Burstein, M. and R. Pelavin, 1983. Hierarchical channel router, Integration, the VLSI Journal 1, 21–38.

    Article  Google Scholar 

  7. Chan, Wan S., 1983. A new channel routing algorithm, in: R. Bryant, ed. 3rd Caltech Conference on VLSI, Comp. Sci. Press, Rockville, 117–139.

    Google Scholar 

  8. Cohoon, J.P. and P. L. Heck, 1988. BEAVER: A computational-geometry-based tool for switchbox routing, IEEE Trans. Computer-Aided Design CAD-7, 684–697.

    Article  Google Scholar 

  9. Cutler, M. and Y. Shiloach, 1978. Permutation layout, Networks 8, 253–278.

    Article  MATH  MathSciNet  Google Scholar 

  10. Deutsch, D, 1976. A dogleg channel router, Proc. 13rd Design Automation Conf. 425–433.

    Google Scholar 

  11. Enbody, R.J., G. Lynn, and K. H. Tan, 1991. Routing the 3-D chip, Proc. 28th ACM/IEEE Design Automation Conf. 132–137.

    Google Scholar 

  12. Gallai T. His unpublished results have been announced in A. Hajnal and J. Surányi, 1958. Über die Auflösung von Graphen in vollständige Teilgraphen, Ann. Univ. Sci. Budapest Eötvös Sect. Math. 1, 115–123.

    Google Scholar 

  13. Games, R. A., 1986. Optimal book embeddings of the FFT, Benes, and barrel shifter networks, Algorithmica 1, 233–250.

    Article  MATH  MathSciNet  Google Scholar 

  14. Gao, S. and M. Kaufmann, 1994. Channel routing of multiterminal nets, J. of the ACM 41, 791–818.

    Article  MATH  MathSciNet  Google Scholar 

  15. Grötschel, M., A. Martin, and R. Weismantel, 1993. Routing in grid graphs by cutting planes, in: G. Rinaldi and L. Wolsey, eds. Integer programming and combinatorial optimization, 447–461.

    Google Scholar 

  16. Hambrusch, S. E., 1985. Channel routing in overlap models, IEEE Trans. Computer-Aided Design of Integrated Circ. Syst. CAD-4, 23–30.

    Article  Google Scholar 

  17. Hashimoto, A. and J. Stevens, 1971. Wire routing by optimizing channel assignment, Proc. 8th Design Automation Conf. 214–224.

    Google Scholar 

  18. LaPaugh A. S., 1980. A polynomial time algorithm for optimal routing around a rectangle, Proc. 21st FOCS Symp. 282–293.

    Google Scholar 

  19. Leighton, T., 1983. Complexity issues in VLSI: Optimal layouts for the shuffle-exchange graph and other networks, The MIT Press, Cambridge, MA.

    Google Scholar 

  20. Leighton, T. and A. L. Rosenberg, 1986. Three-dimensional circuit layouts, SIAM J. Computing 15, 793–813.

    Article  MATH  MathSciNet  Google Scholar 

  21. Leighton, T., S. Rao and A. Srinivasan, 1999. New algorithmic aspects of the Local Lemma with applications to routing and partitioning, Proc. Tenth Annual ACMSIAM Symp. on Discrete Algorithms, ACM/SIAM, New York and Philadelphia, 643–652.

    Google Scholar 

  22. Luk, W.K., 1985. A greedy switch-box router, Integration, the VLSI Journal 3, 129–149.

    Article  Google Scholar 

  23. Rosenberg, A.L., 1983. Three-dimensional VLSI: A case study, J. ACM. 30, 397–416.

    Article  MATH  Google Scholar 

  24. Shirakawa, I., 1980. Some comments on permutation layout, Networks 10, 179–182.

    Article  Google Scholar 

  25. Szeszlér D., 1997. Switchbox routing in the multilayer Manhattan model, Ann. Univ. Sci. Budapest Eötvös Sect. Math, 40, 155–164.

    MATH  Google Scholar 

  26. Szymanski, T. G., 1985. Dogleg channel routing is NP-complete, IEEE Trans. Computer-Aided Design of Integrated Circ. Syst. CAD-4, 31–41.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science and Information Theory, Budapest University of Technology and Economics, H-1521, Budapest, Hungary

    András Recski & Dávid Szeszlér

Authors
  1. András Recski
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Dávid Szeszlér
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Research Institute of Educational Development, Tokai University, 2-28-4 Tomigaya, Shibuya-ku, Tokyo, 151-0063, Japan

    Jin Akiyama

  2. Department of Computer and Information Sciences, Ibaraki University, Hitachi, 316-8511, Japan

    Mikio Kano

  3. Department of Mathematics, Tokai University, 3-20-1 Orido Shimizu-shi, Shizuoka, 424-8610, Japan

    Masatsugu Urabe

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Recski, A., Szeszlér, D. (2001). 3—Dimensional Single Active Layer Routing. In: Akiyama, J., Kano, M., Urabe, M. (eds) Discrete and Computational Geometry. JCDCG 2000. Lecture Notes in Computer Science, vol 2098. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-47738-1_30

Download citation

  • DOI: https://doi.org/10.1007/3-540-47738-1_30

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-42306-5

  • Online ISBN: 978-3-540-47738-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation