Skip to main content
SpringerLink
Log in

Optimal channel placement for multi-terminal nets

  • Conference paper
  • First Online:
Algorithms and Data Structures (WADS 1989)

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

Included in the following conference series:

  • 685 Accesses

Abstract

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.

This research was supported by the Office of Naval Research under Contracts N00014-84-K-0502 and N00014-86-K-0689, and the National Science Foundation under Grant DCR-8451393, with matching funds from AT&T.

This research was supported by the Office of Naval Research under Contracts N00014-84-K-0502 and N00014-86K-0689, and by the National Science Foundation under Grants DMC-84-13496 and MIP-87-15652.

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.J. Atallah, S.E. Hambrusch, ‘On Bipartite Matchings of Minimum Density', Journal of Algorithms, Vol. 8, pp 480–502, 1987.

    Article  Google Scholar 

  2. A.V. Aho, J.E. Hopcroft, J.D. Ullman, The Design and Analysis of Computer Algorithms, Addison-Wesley, 1974.

    Google Scholar 

  3. J. Bentley, ‘Programming Pearls', CACM, Vol. 27, Nr. 9, pp 865–871, 1984.

    Google Scholar 

  4. 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. J. Cong, C.L. Liu, ‘Over-the-Cell Channel Routing', Proceedings of IEEE Internat. Conference on Computer-Aided Design, 1988.

    Google Scholar 

  6. 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. 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. 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. R.Y. Pinter, ‘The Impact of Layer Assignment Methods on Layout Algorithms for Integrated Circuits', Ph.D. Thesis, MIT, 1982.

    Google Scholar 

  10. 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.L. Rivest, ‘The PI — Placement and Interconnect — System', Proc. of 19-th Design Automation Conf., pp 475–481, 1982.

    Google Scholar 

  12. 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. H.J. Supowit, ‘Reducing Channel Density in Standard Cell Layout', Proceedings of 20-th Design Automation Conference, pp 263–269, 1983.

    Google Scholar 

  14. J. Soukup, ‘Circuit Layout', Proceedings of IEEE, Vol. 69, pp 1281–1304, 1981.

    Google Scholar 

  15. M. Sarrafzadeh, F.P. Prepatata, ‘Compact Channel Routing of Multi-terminal Nets', Annals of Discrete Mathematics, North Holland, April 1985.

    Google Scholar 

  16. 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. T. Yoshimura, E.S. Kuh, ‘Efficient Algorithms for Channel Routing', IEEE Trans. on Computer-Aided Design, Vol. 1, pp 25–35, 1982.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Sciences, Purdue University, 47907, West Lafayette, IN

    Mikhail J. Atallah & Susanne E. Hambrusch

Authors
  1. Mikhail J. Atallah
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Susanne E. Hambrusch
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

F. Dehne J. -R. Sack N. Santoro

Rights and permissions

Reprints and permissions

Copyright information

© 1989 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Atallah, M.J., Hambrusch, S.E. (1989). Optimal channel placement for multi-terminal nets. In: Dehne, F., Sack, J.R., Santoro, N. (eds) Algorithms and Data Structures. WADS 1989. Lecture Notes in Computer Science, vol 382. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-51542-9_10

Download citation

  • DOI: https://doi.org/10.1007/3-540-51542-9_10

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-48237-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation