Skip to main content
Springer Nature Link
Log in

An optimal channel-routing algorithm for a restricted class of multi-terminal nets

  • Track 9: VLSI Design
  • Conference paper
  • First Online:
Computing in the 90's (Great Lakes CS 1989)

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

Included in the following conference series:

  • 108 Accesses

Abstract

We are given a channel-routing problem in which all nets have either (1) all their terminals on the same side of the channel, or (2) all but their rightmost terminal on the same side. This is the only class of multi-terminal nets for which an optimal algorithm has been found. Our paper describes an algorithm that routes the channel in knock-knee mode using D tracks, where D is the channel density and is a trivial lower-bound for channel width. Our implementation has complexity O(nlog2 D), where n is the number of columns in the channel.

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. L. Brady and D. J. Brown, “VLSI routing: Four layers suffice,” Advances in Computing Research, vol. 2, pp. 245–257, JAI Press, Inc., 1984.

    Google Scholar 

  2. K. Mehlhorn, F. P. Preparata, and M. Sarrafzadeh, “Channel routing in knock-knee mode: Simplified Algorithms and Proofs,” Algorithmica, pp. 213–221, 1986.

    Google Scholar 

  3. F. P. Preparata and W. Lipski, Jr., “Optimal three-layer channel routing,” IEEE Transactions on Computers, vol. C-33, no. 5, pp. 427–437.

    Google Scholar 

  4. R. L. Rivest, A. E. Baratz, and G. Miller, “Provably good channel routing algorithms,” Proceedings CMU Conference on VLSI Systems and Computations, pp. 151–159, October, 1981.

    Google Scholar 

  5. M. Sarrafzadeh and F. P. Preparata, “Compact channel routing of multiterminal nets,” Annals of Discrete Mathematics, vol. 25, pp. 255–280, 1985.

    MATH  MathSciNet  Google Scholar 

Download references

Authors
  1. Dee Parks
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Naveed A. Sherwani Elise de Doncker John A. Kapenga

Rights and permissions

Reprints and permissions

Copyright information

© 1991 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Parks, D. (1991). An optimal channel-routing algorithm for a restricted class of multi-terminal nets. In: Sherwani, N.A., de Doncker, E., Kapenga, J.A. (eds) Computing in the 90's. Great Lakes CS 1989. Lecture Notes in Computer Science, vol 507. Springer, New York, NY. https://doi.org/10.1007/BFb0038510

Download citation

  • DOI: https://doi.org/10.1007/BFb0038510

  • Published:

  • Publisher Name: Springer, New York, NY

  • Print ISBN: 978-0-387-97628-0

  • Online ISBN: 978-0-387-34815-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics