Advertisement

Some new results on a restricted channel routing problem

  • E. Lodi
  • L. Pagli
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 227)

Abstract

In the Manhattan model, a two-terminal channel routing subproblem is considered, where the run length is at most two and for each net, its exit terminal is to the right of its entry terminal. For this problem, a lower bound of d+3 tracks, where d is the density, is derived and a polynomial optimal algorithm is given.

Keywords

Exchange Path Horizontal Segment Entry Column Destination Track Channel Route 
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. [1]
    Hashimoto A. and Stevens J. "Wire Routing by Optimizing Channel Assignment within Large Apertures", Proc. 8-th Design Automation Workshop, IEEE (1971), 214–224.Google Scholar
  2. [2]
    Hightower D. "The Interconnection Problem: A Tutorial", Computer 7, 4 (April 1974), 18–32.Google Scholar
  3. [3]
    Deutsch D. N. "A ‘Dogleg’ Channel Router", Proc. 19-th Design Automation Conference, IEEE (1976), 425–433.Google Scholar
  4. [4]
    Preparata, F. P. and Lipsky W. "Optimal Three-Layer Channel Routing", IEEE Transections on Computers, 33, 5 (May 1984), 427–437.Google Scholar
  5. [5]
    Kawamoto T. and Kajitani Y. "The Minimum Width Routing of a 2-Row 2-Layer Polycell-Layout", Proc. 16-th Design Automation Conference, IEEE (1979), 290–296.Google Scholar
  6. [6]
    Szymanski T. "Dogleg Channel Routing is NP-complete", to appear.Google Scholar
  7. [7]
    Rivest R. L., Baratz A. E. and Miller G. "Provably Good Channel Routing Algorithms", Proc. CMU Conference on VLSI Systems and Computations, (1981), 153–159.Google Scholar
  8. [8]
    Baker B. S., S. N. Bhatt and T. Leighton "An Approximation Algorithm for Manhattan Routing", Advances in Computing Research, 2, (1984), 205–229.Google Scholar
  9. [9]
    Brown D. and Rivest R. L. "New Lower Bounds on Channel Width", Proc. CMU Conference on VLSI Systems and Computations, (Computer Science Press 1981), 178–185.Google Scholar
  10. [10]
    Yoshimura T. and Kuh E. "Efficient Algorithms for Channel Routing", IEEE Transections on Computer, CAD-1, 1 (January 1982), 25–35.Google Scholar
  11. [11]
    Lodi E. and Preparata F. P. "A Heuristic for Manahattan Routing" to appear.Google Scholar
  12. [12]
    Kerninghan B. W., Schweickert D. G., Persky G. "An Optimum Channel-Routing Algorithm for Polycell Layouts of Integrated Circuits", Proc. 11-th DA Workshop, 1973, 26–46.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1986

Authors and Affiliations

  • E. Lodi
    • 1
  • L. Pagli
    • 1
  1. 1.Dipartimento di Informatica di PisaItaly

Personalised recommendations