Channel routing with short wires

  • Michael Kaufmann
  • Ioannis G. Tollis
Compaction And Channel Routing
Part of the Lecture Notes in Computer Science book series (LNCS, volume 319)


Channel routing is a fundamental problem in VLSI layout and has received much attention recently ([F],[MPS],[PL],[BBL],[BBBL],[GK]..). Unfortunately, most algorithms produce good layouts only with respect to the channel width, but not with respect to the length of the wires, which is a second important measure for the performance of the layout. Here, we consider the problem of routing a given channel with short wires. We show that our algorithms produce routings with minimum total wire length.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [BBBL]
    B. Berger, M. Brady, D. Brown, and F. T. Leighton: “Nearly Optimal Algorithms and Bounds for Multilayer Channel Routing”. Manuscript.Google Scholar
  2. [BBL]
    B. S. Baker, S. N. Bhatt, and F. T. Leighton: “An Approximation Algorithm for Manhattan Routing”. Proc. of the 15th Ann. ACM Symposium on Theory of Computing, pp. 477–486 (1983).Google Scholar
  3. [BB]
    M. Brady and D. Brown: “VLSI Routing: Four Layers Suffice”. MIT VLSI Conference 1984.Google Scholar
  4. [BP]
    D. Brown and F. P. Preparata: “Three-Layer Channel Routing of Multiterminal Nets”. Technical Report, Coordinated Science Lab., University of Illinois at Urbana-Champaign (Oct. 1982).Google Scholar
  5. [F]
    A. Frank “Disjoint Paths in Rectilinear Grids” Combinatorica, Vol. 2. No. 4, 1982, pp. 361–371MATHMathSciNetGoogle Scholar
  6. [GK]
    S. Gao and M. Kaufmann: “Channel Routing of Multiterminal Nets”. Proc. of 28th Ann. Symposium on Foundations of Computer Science, pp. 316–325 (1987).Google Scholar
  7. [KM]
    M. Kaufmann and K. Mehlhorn: “Routing through a Generalized Switchbox”. Journal of Algorithms 7, pp. 510–531 (1986).MATHMathSciNetCrossRefGoogle Scholar
  8. [MPS]
    K. Mehlhorn, F. P. Preparata, and M. Sarrafzadeh: “Channel Routing in Knock-Knee Mode: Simplified Algorithms and Proofs”. Algorithmica 1(2), pp. 213–221, Springer-Verlag (1986).MATHCrossRefGoogle Scholar
  9. [PL]
    F. P. Preparata and W. Lipski: “Optimal Three-Layer Channel Routing”. IEEE Trans. on Computers C-33, pp. 427–437 (1984).Google Scholar
  10. [RBM]
    R. L. Rivest, A. Baratz, and G. Miller: “Provably Good Channel Routing Algorithms”. Proc. CMU Conf. on VLSI, pp. 153–159 (Oct. 1981).Google Scholar
  11. [S]
    M. Sarrafzadeh: “On the Complexity of the General Channel Routing Problem in the Knock-Knee Mode”. to appear in IEEE Transactions on Computer-Aided DesignGoogle Scholar
  12. [SP]
    M. Sarrafzadeh and F. P. Preparata: “Compact Channel Routing of Multiterminal Nets”. Annals of Discrete Math., North Holland (Apr. 1985)Google Scholar
  13. [T]
    I. G. Tollis: “A New Algorithm for Wiring Layouts”. Proceedings of AWOC, (1988)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1988

Authors and Affiliations

  • Michael Kaufmann
    • 1
  • Ioannis G. Tollis
    • 2
  1. 1.FB 10, InformatikUniversität des SaarlandesSaarbrückenWest Germany
  2. 2.Department of Computer ScienceThe University of Texas at DallasRichardson

Personalised recommendations