Optimal channel placement for multi-terminal nets

  • Mikhail J. Atallah
  • Susanne E. Hambrusch
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 382)


We consider multi-terminal placement problems in which the terminals of n multi-terminal nets can be placed in a number of given positions in a channel. The positions for the terminals must be chosen so that the resulting channel routing problem has minimum density. The general multi-terminal placement problem is easily proved to be NP-hard. We show that a number of variants have efficient placement algorithms. The variant in which the upper row positions of the terminals have already been fixed can be viewed as an interval extension problem. For a class of such interval extension problems, we present an efficient algorithm based on a combinatorial characterization of a density-minimizing interval extension.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [AH]
    M.J. Atallah, S.E. Hambrusch, ‘On Bipartite Matchings of Minimum Density', Journal of Algorithms, Vol. 8, pp 480–502, 1987.CrossRefGoogle Scholar
  2. [AHU]
    A.V. Aho, J.E. Hopcroft, J.D. Ullman, The Design and Analysis of Computer Algorithms, Addison-Wesley, 1974.Google Scholar
  3. [B]
    J. Bentley, ‘Programming Pearls', CACM, Vol. 27, Nr. 9, pp 865–871, 1984.Google Scholar
  4. [CL1]
    Y.K. Chen, M.L. Liu, ‘Three-layer Channel Routing', IEEE Trans. on CAD, Vol. cad-2, Nr. 2, pp 156–163, 1984.Google Scholar
  5. [CL2]
    J. Cong, C.L. Liu, ‘Over-the-Cell Channel Routing', Proceedings of IEEE Internat. Conference on Computer-Aided Design, 1988.Google Scholar
  6. [CP]
    J. Cong, B. Preas, ‘A New Algorithm for Standard Cell Global Routing', Proceedings of IEEE Internat. Conference on Computer-Aided Design, 1988.Google Scholar
  7. [GCW]
    I.S. Gopal, D. Coppersmith, C.K. Wong, ‘Optimal Wiring of Movable Terminals', IEEE Trans. on Computers, Vol. c-32, 9, pp 845–858, 1983.Google Scholar
  8. [HS]
    A. Hashimoto, J. Stevens, ‘Wire Routing by Optimizing Channel Assignment within Large Apertures', Proc. of 8-th Design Aut. Conf., pp 155–169, 1971.Google Scholar
  9. [P]
    R.Y. Pinter, ‘The Impact of Layer Assignment Methods on Layout Algorithms for Integrated Circuits', Ph.D. Thesis, MIT, 1982.Google Scholar
  10. [PL]
    F.P. Preparata, W. Lipski, ‘Three Layers are enough', Proceedings of the 23rd Annual IEEE Foundations of Comp. Sc. Conf., pp 350–357, 1982.Google Scholar
  11. [R]
    R.L. Rivest, ‘The PI — Placement and Interconnect — System', Proc. of 19-th Design Automation Conf., pp 475–481, 1982.Google Scholar
  12. [RBM]
    R.L. Rivest, A.E. Baratz, G. Miller, ‘Provably Good Channel Routing Algorithms', Proc. of the CMU Conf. on VLSI Syst. and Comp., pp 153–159, 1981.Google Scholar
  13. [S1]
    H.J. Supowit, ‘Reducing Channel Density in Standard Cell Layout', Proceedings of 20-th Design Automation Conference, pp 263–269, 1983.Google Scholar
  14. [S2]
    J. Soukup, ‘Circuit Layout', Proceedings of IEEE, Vol. 69, pp 1281–1304, 1981.Google Scholar
  15. [SP]
    M. Sarrafzadeh, F.P. Prepatata, ‘Compact Channel Routing of Multi-terminal Nets', Annals of Discrete Mathematics, North Holland, April 1985.Google Scholar
  16. [T]
    M. Terai, ‘A Method of Improving the Terminal Assignment in the Channel Routing for Gate Arrays', IEEE Trans. on Comp.-Aided Design, Vol. 4, pp 329–335, 1985.Google Scholar
  17. [YK]
    T. Yoshimura, E.S. Kuh, ‘Efficient Algorithms for Channel Routing', IEEE Trans. on Computer-Aided Design, Vol. 1, pp 25–35, 1982.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1989

Authors and Affiliations

  • Mikhail J. Atallah
    • 1
  • Susanne E. Hambrusch
    • 1
  1. 1.Department of Computer SciencesPurdue UniversityWest Lafayette

Personalised recommendations