Skip to main content
SpringerLink
Log in

Zur Bedeutung der diskreten Mathematik für die Konstruktion hochintegrierter Schaltkreise

  • Chapter
Technologie, Wachstum und Beschäftigung

  • 183 Accesses

Zusammenfassung

Angesichts der schnell fortschreitenden Miniaturisierung bei der Computertechnologie kommt dem Design und Layout hochintegrierter Schaltkreise besondere Bedeutung zu, die immense wirtschaftliche und technologie-politische Konsequenzen hat. Die jüngsten Fortschritte in diesem Gebiet basieren in zunehmendem Maße auf der Ergänzung bzw. Ersetzung „ingenieurmäßiger“Verfahren durch algorithmische Prinzipien und Methoden der diskreten Mathematik. Dieser Artikel zeigt die prinzipiellen Möglichkeiten der Anwendung von neuesten mathematischen Entwicklungen aus diesem Bereich beim VLSI-Layout auf, und berichtet über vorliegende Erfahrungen. Es zeigt sich, daß die diskrete Mathematik trotz ihrer relativ jungen Geschichte bereits eine Fülle von Ergebnissen bereitstellt, die einen unmittelbaren Praxisbezug haben und insbesondere in kritischen High-Tech-Bereichen zu einer wesentlichen Verbesserung existierender Verfahren beitragen können.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 59.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 79.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Literatur

  • Atallah M.J. und Hambrusch S.E. [1986]: An assignment algorithm with applications to integrated circuit layout. Discr. Appl. Math. 13 (1986) 9–22.

    Article  Google Scholar 

  • Barahona F., Grötschel M., Jünger M. und Reinelt G. [1986]: An application of combinatorial optimization to statistical physics and circuit layout designs. Preprint, Universität Augsburg (1986).

    Google Scholar 

  • Burkard R.E. [1985]: Assignment problems: Recent solution methods and applications. Preprint, Universität Graz, 1985.

    Google Scholar 

  • Chen N.P [1983]: New algorithms for Steiner tree on graphs. Proc. ISCAS (1983) 1217–1219.

    Google Scholar 

  • Frank A. [1982]: Disjoint paths in a rectilinear grid. Combinatorica 2 (1982) 361–371.

    Article  Google Scholar 

  • Frank A. [1985]: Edge-disjoint paths in planar graphs. J. of Comb. Theory (B) 39 (1985) 164–178.

    Article  Google Scholar 

  • Galperin H. und Wigderson A. [1983]: Succint representations of graphs, in: Information & Control 56 (1983) 183–198.

    Article  Google Scholar 

  • Golumbic M.C. [1980]: Algorithmic graph theory and perfect graphs. Academic Press (1980).

    Google Scholar 

  • Hanan M., Wolff P.K. und Anguli B.J. [1976]: Some experimental results on placement techniques, in: Proc. 13th Design Automation Conf. (1976) 214–224.

    Google Scholar 

  • Hashimoto A. und Stevens J. [1971]: Wire routing by optimizing channel assignment within large apertures. Proc. 8th Annual Design Automation Workshop Under Joint Sponsorship of SHARE, ACM, and IEEE (1971).

    Google Scholar 

  • Hassin R. [1981]: Maximum flow in (s, t) planar networks. Inform. Process. Lett. 13 (1981) 107.

    Article  Google Scholar 

  • Hu T.C. und E.S. Kuh [1985]: Theory and concepts of circuit layout, in: VLSI Circuit Layout: Theory and Design (T. C. Hu, E.S. Kuh eds.). IEEE Press (1985).

    Google Scholar 

  • Hu T.C. und Moerder K. [1985]: Multiterminal flows in a hypergraph. in: VLSI Circuit Layout: Theory and Design (T.C. Hu, E.S. Kuh eds.). IEEE Press (1985)

    Google Scholar 

  • Hu T.C. und Shing M.T. [1985]: The alpha-beta routing, in: VLSI Circuit Layout: Theory and Design (T. C. Hu, E.S. Kuh eds.). IEEE Press (1985)

    Google Scholar 

  • Hwang F.K. [1978]: The rectilinear Steiner Problem. Design Automation and Fault-Tolerant Compuing 2 (1978) 303–310.

    Google Scholar 

  • Itai A. und Shiloach Y. [1979]: Maximum flow in planar networks. SIAM J. Comp. 8 (1979) 135–150.

    Article  Google Scholar 

  • Karmarker N. und Karp R.M. [1982]: The differencing method of set partitioning. UCB/CSD82/113, Univ. of Calif., Berkeley (1982).

    Google Scholar 

  • Kaufmann M. und Mehlhorn K. [1986]: On local routing of two-terminal nets. Universität des Saarlandes, Preprint (1986).

    Google Scholar 

  • Kernighan B.W. and Lin S. [1970]: An efficient heuristic procedure for partitioning graphs. Bell Syst. Tech. J. 49, (1970) 291–307.

    Google Scholar 

  • Körte B. und Loväsz L. [1984]: Greedoids, a structural framework for the greedy algorithm, in: W.R. Pulleyblank (ed.): Progress in Combinatorial Optimiyation. Proceedings of the Silver Jubilee Conference on Combinatorics, Waterloo, June 1982, pp. 221/243. Academic Press, London/New York/San Francisco 1984.

    Google Scholar 

  • Kruskal J.B. [1956]: On the shortest spanning subtree of a graph. Proc. Am. Math. Soc., 7 (1956) 48–50.

    Article  Google Scholar 

  • Leighton, F.T. [1983]: Complexity Issues in VLSI. Cambridge, MA:MIT Press (1983).

    Google Scholar 

  • Leiserson, C.E. [1983]: Area-Efficient VLSI Computation. Cambridge, MA:MIT Press (1983).

    Google Scholar 

  • Lengauer T. und Mehlhorn K. [1984]: The HILL system: A design environment for the hierarchical specification, compaction, and simulation of integrated circuit layouts. Proc. MIT Conference on Advanced Research in VLSI(P. Penfield Jr. ed.) Artech House Co. (1984) 139–148.

    Google Scholar 

  • Lengauer T. [1986]: Exploiting hierarchy in VLSI design, in: Lecture Notes in Computer Science (P. Makedon et al.eds.) (1986) 180–194.

    Google Scholar 

  • Lengauer T. [1984]: Hierarchical graph algorithms. TR-SFB 124, No. 15, FB 10 Universität des Saarlandes, Saarbrücken, West Germany (1984).

    Google Scholar 

  • Mead C. und Conway L. [1980]: Introduction to VLSI Systems. Reading. MA. Addison Wesley (1980).

    Google Scholar 

  • Mehlhorn K. und Preparata F.P. [1986]: Routing through a Rectangle. J. ACM 33 (1986) 60–85.

    Article  Google Scholar 

  • Möhring R.H. und Radermacher F.J. [1984]: Substitution decomposition for discrete structures and connections with combinatorial optimization. Ann. Discrete Math. 19 (1984) 257–356.

    Google Scholar 

  • Möhring R.H. [1986]: Algorithmic aspects of the substitution decomposition in optimization over relations, set systems and boolean functions. Annals of Op. Res. 4 (1986) 195–225.

    Google Scholar 

  • Möhring R.H. [1985]: Algorithmic aspects of comparability graphs and interval graphs, in: I. Rival (ed) Graphs and Orders, Reidel Publ. (1985) 41–101.

    Google Scholar 

  • Ohtsuki T. (ed.) [1986]. Layout design and verification. North-Holland (1986).

    Google Scholar 

  • Okamura H. und Seymour F. [1981]: Multicommodity flows in planar graphs. J. Combin. Theory Ser. B31 (1981) 75–81.

    Google Scholar 

  • Prim R.C. [1957]: Shortest connection networks and some generalization. Bell Sys. Tech. J. 36 (1957) 1389–1401.

    Google Scholar 

  • Rivest R.L. und Fiduccia C.M. [1982]: A greedy channel router, in Proc. of 19th IEEE Design Automation Conf., (1982) 418–424.

    Google Scholar 

  • Rothe G. und Rendl F. [1985]: Minimizing the density of terminal assignments in layout design. Preprint, Universität Graz 1985.

    Google Scholar 

  • Schrijver A. und van Hoesel C. [1986]: Edge-disjoint homotopic paths in a planar graph with one hole. Report OS-R86O8, Centrum voor Wiskunde en Informatica, Amsterdam, 1986.

    Google Scholar 

  • Schweikert D.G. und Kernighan B.W. [1972]: A proper model for the partitioning of electrical circuits. in: Proc. 9th Design Automation Workshop (1972) 57–62.

    Google Scholar 

  • Soukup J. [1981]: Circuit layout. Proc. IEEE, 69, (1981) 1281–1304.

    Article  Google Scholar 

  • Szymanski T. G. [1985]: Dogleg channel routing is NP-complete. IEEE Trans. CAD., Cad 4 (1985) 31–41.

    Google Scholar 

  • Ullman J.D. [1984]: Computational aspects of VLSI. Computer Science Press, Rockville MD (1984).

    Google Scholar 

  • Yannakakis M [1986a]: Linear and book embeddings of graphs, in: Lecture Notes in Computer Science (F. Makedon et al. eds.) (1986) 226–236.

    Google Scholar 

  • Yannakakis M. [1986b]: Four pages are necessary and sufficient for planar graphs. 17th ACM Symp. on Theory of Computing (1986).

    Google Scholar 

  • Yoshimura T. und Kuh E.S. [1982]: Efficient algorithms for channel routing. IEEE Trans, on Comp. Aided Design of Integrated Circuits and Systems, CAD 1 (1982) 25–35.

    Google Scholar 

Download references

Authors
  1. Bernhard Korte
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Rolf H. Möhring
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Institut für Statistik und Mathematische Wirtschaftstheorie Rechenzentrum, Universität Karlsruhe, Zirkel 2, Postfach 6980, 7500, Karlsruhe 1, Germany

    Rudolf Henn

Rights and permissions

Reprints and permissions

Copyright information

© 1987 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Korte, B., Möhring, R.H. (1987). Zur Bedeutung der diskreten Mathematik für die Konstruktion hochintegrierter Schaltkreise. In: Henn, R. (eds) Technologie, Wachstum und Beschäftigung. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-72831-0_49

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-72831-0_49

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-72832-7

  • Online ISBN: 978-3-642-72831-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation