Skip to main content
Springer Nature Link
Log in

SFB 124: VLSI-Entwurfsmethoden und Parallelität

Projektbereich B: Methoden des VLSI-Entwurfs

  • Conference paper
GI — 18. Jahrestagung II

Part of the book series: Informatik-Fachberichte ((INFORMATIK,volume 188))

  • 56 Accesses

Zusammenfassung

Im Projektbereich B des SFBs 124 gibt es 4 Teilprojekte, die sich auf verschiedene Aspekte des Chipentwurfs konzentrieren.

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

Access this chapter

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

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.

Similar content being viewed by others

Literatur

  1. Becker B., Hotz G., Kolla R. und Molitor P.: Ein logischer Kalkül zur Konstruktion von integrierten Schaltkreisen. INFORMATIK, FORSCHUNG & ENTWICKLUNG, Band 1 Heft 1&2, pp. 38–47/72–82, Springer-Verlag (1986).

    Google Scholar 

  2. L. Thiele: Algorithmisch spezialisierte Strukturen für integrierte Schaltungen Habilitationsschrift, TU München 1986.

    Google Scholar 

Literatur

  1. T. Beth: “Ein Krypthographieprozessor”. Vortrag auf der Oberwolfachtagung “VLSI”, 1987.

    Google Scholar 

  2. G. Bilardi, F.P. Preparata: “The Influence of Key Length on the Area-Time Comlexity of Sorting”. Proc. of the 12th ICALP, pp. 53–62 (1985).

    Google Scholar 

Eigene Veröffentlichungen

  1. R. Fleischer: “Kommunikationskomplexität von Mehrprozessorsystemen”. Diplomarbeit (1987).

    Google Scholar 

  2. M. Fürer, K. Mehlhorn: “AT 2-Optimal Galois-Field Multiplier for VLSI”. Proc. of AWOC, LNCS 227, pp. 217–225 (1986).

    Google Scholar 

  3. P. Lichter: “Realisierung eines VLSI-Chip für das Gleitkomma-Skalarprodukt der Kulisch-Arithmetik”. Diplomarbeit (1988).

    Google Scholar 

  4. K. Mehlhorn, F. P. Preparata: “Area-time Optimal Division for T = Ω((log n)1+∈)”. Information and Computation 75. 1987, pp. 270–282.

    Article  MathSciNet  Google Scholar 

  5. M. Porzberg: “VLSI-Implementierung eines schnellen Sortieralgorithmus basierend auf einem Netzwerk von Orthogonalen Bäumen”. Diplomarbeit (1986).

    Google Scholar 

  6. P. Zell: “Integration der Kanaleinheit mit HILL und VENUS”. Diplomarbeit (1987).

    Google Scholar 

Literatur

  1. A. Aggarwal, B. Chazelle, L. Guibas, C. O’Dunlaing, C. Yap: “Parallel Computational Geometry”. Proc. of the 26th FOCS, pp. 468–477 (1985).

    Google Scholar 

  2. M. Atailah, M. Goodrich: “Efficient Plane Sweeping in Parallel”. Proc. of the 2nd ACM Symposium on Computational Geometry, pp. 216–255 (1986).

    Chapter  Google Scholar 

  3. M. Atailah, R. Cole, M. Goodrich: “Cascading Divide-and-Conquer: A Technique for Designing Parallel Algorithms”. Tech. Rep. 665, Dept. of Comp. Sci., Purdue Univ. (1987).

    Google Scholar 

  4. A.V. Goldberg, S.A. Plotkin, G.E. Shannon: “Parallel Symmetry-Breaking in Sparse Graphs”. Proc. of the 19th STOC, pp. 315–324 (1987).

    Google Scholar 

  5. J.H. Reif: “An Optimal Parallel Algorithm for Integer Sorting”. Proc. of the 26 th FOCS, pp. 496–504 (1985).

    Google Scholar 

Eigene Veröffentlichungen

  1. T. Hagerup, M. Chrobak, K. Diks: “Parallel 5—Coloring of Planar Graphs”. Proc. of the 14th ICALP, pp. 304–313 (1987).

    Google Scholar 

  2. T. Hagerup: “Towards Optimal Parallel Bucket Sorting”. Information and Computation 75, pp. 39–51 (1987).

    Article  MATH  MathSciNet  Google Scholar 

  3. T. Hagerup: “Optimal Parallel Algorithms on Planar Graphs”. SFB-Bericht 16/1987.

    Google Scholar 

  4. T. Hagerup: “Planar DFS in O(log n) Parallel Time”. SFB-Bericht 18/1987.

    Google Scholar 

  5. H. Jung, K. Mehlhorn: “Parallel Algorithms for Computing Maximal Independent Sets in Trees and for Updating Minimum Spanning Trees”. IPL, to appear.

    Google Scholar 

  6. Ch. Rüb: “Parallel Line Segment Intersection Reporting”. SFB-Bericht 12/1987.

    Google Scholar 

Literatur

  1. A.R. Karlin, E. Upfai: “Parallel Hashing — An Efficient Implementation of Shared Memory”. Proc. of the 18th STOC, pp. 160–168 (1986).

    Google Scholar 

  2. F. Luccio, A. Pietracaprina, G. Pucci: “A New Scheme for the Deterministic Simulation of PRAM’s in VLSI”. Nota scientifica S-87–11, Giugno 1987.

    Google Scholar 

  3. A.G. Ranade: “How to Emulate Shared Memory”. Proc. of the 28th FOCS, pp. 185–194 (1987).

    Google Scholar 

  4. E. Upfal, A. Wigderson: “How to Share Memory in a Distributed System”. Journal of the ACM 34, pp. 116–127 (1987).

    Article  MATH  MathSciNet  Google Scholar 

Eigene Veröffentlichungen

  1. H. Alt, T. Hagerup, K. Mehlhorn, F.P. Preparata: “Deterministic Simulation of Idealized Parallel Computers on More Realistic Ones”. SIAM Journal on Computing 16, pp. 808–835 (1987).

    Article  MATH  MathSciNet  Google Scholar 

Literatur

  1. W.E. Cory: “Layla: A VLSI Layout Language”. DA 85, pp. 245–251.

    Google Scholar 

  2. P. Eichenberger: “Fast Symbolic Layout Translation for Custom VLSI Integrated Circuits”. Ph.D. dissertation, Stanford University, 1986.

    Google Scholar 

  3. C.D. Regers, J.B. Rosenberg, S.W. Daniel: “MCNC’s Vertically Integrated Symbolic Design System”. DA 85, pp. 62–68.

    Google Scholar 

  4. D.D. Hill, J.P. Fishburn, M.D.P. Leland: “Effective Use of Virtual Grid Compaction in Macro-Modul Generators”. DA 85, pp. 777–780.

    Google Scholar 

Eigene Veröffentlichungen

  1. T. Hagerup, W. Rülling: “A Generalized Topological Sorting Problem”. Proc. of the AWOC, LNCS 227, pp. 261–270 (1986).

    Google Scholar 

  2. W. Rülling: “Einführung in die Chip-Entwurfssprache HILL”. SFB-Bericht 04/1987.

    Google Scholar 

Literatur

  1. E. Clarke, Y. Feng: “Escher, A Geometrie Layout System for Recursively Defined Circuits”. Department of Computer Science, Carnegie Mellon University, 1985.

    Google Scholar 

Eigene Veröffentlichungen

  1. M. Heitkamp: “Ein Intelligenter Graphik-Editor für Stickdiagramme”. Diplomarbeit, 1987.

    Google Scholar 

Literatur

  1. J.D. Williams: “STICKS — A Graphical Compiler for High Level LSI Design”. National Computer Conference, pp. 289–295 (1978).

    Google Scholar 

  2. Th. Lengauer: “Exploiting hierarchy in VLSI design”, Technischer Bericht Nr. 35, Universität-Gesamthochschule Paderborn, 1987.

    Google Scholar 

Eigene Veröffentlichungen

  1. W. Rülling: “Constructing Legal Layouts from Stick Diagrams is an NP-Complete Problem”. SFB-Bericht 09/1986.

    Google Scholar 

  2. W. Rülling: “Konstruktion legaler Layouts im HILL System”, in Vorbereitung.

    Google Scholar 

  3. Th. Schilz: “Hierarchische Legalisierung — Generierung von Layouts aus Stickdiagrammen”. Diplomarbeit in Vorbereitung.

    Google Scholar 

Literatur

  1. W.E. Dai, M. Sato, E.S. Kuh: “A Dynamic and Efficient Representation of Building-Block Layout”, DA 87, pp. 376–384.

    Google Scholar 

  2. P. Eichenberger, M. Horowitz,: “Toroidal Compaction of Symbolic Layout for Regular Structures”. ICCAD 1987, pp. 142–145.

    Google Scholar 

  3. M.Y. Hsueh: “Symbolic Layout and Compaction of Integrated Circuits”. Ph.D. Thesis, EECS Division, Univ. of California, Berkeley, 1979.

    Google Scholar 

  4. H. Imai: “Notes on the One-Dimensional Compaction Problem of LSI Layout Viewed from Network Flow Theory and Algorithms”. Technical Report, CSCE-86-C06, Kyushu Univ., Fakuoka, Japan, 1986.

    Google Scholar 

  5. R. Kolla: “Spezifikation und Expansion logisch-topologischer Netze”. Dissertation, 1986.

    Google Scholar 

  6. Th. Lengauer: “The Complexity of Compacting Hierarchically Specified Layouts of Integrated Circuits”. 23th FOCS (1982), pp. 358–369.

    Google Scholar 

  7. Th. Lengauer, J. Doenhardt: “Algorithmic Aspects of One-Dimensional Layout Compaction”. IEEE Transactions on CAD, 1987, pp. 863–878.

    Google Scholar 

  8. F.M. Maley: “Compaction with Automatic Jog Introduction”. 1985 Chapel Hill Conf. on VLSI.

    Google Scholar 

  9. W.S. Scott, J.K. Ousterhout: “Plowing: Interactive Stretching and Compaction in MAGIC”. Proc. of the 21th Design Automation Conference, pp. 166–172 (1984).

    Chapter  Google Scholar 

  10. J.D. Williams: “STICKS — A Graphical Compiler for High Level LSI Design”. National Computer Conference, pp. 289–295 (1978).

    Google Scholar 

  11. X-M. Xiong: “Optimized One-Dimensional Compaction of Building-Block Layout”. Berkeley Memorandum UCB/ERL M87/45 (1987).

    Google Scholar 

Eigene Veröffentlichungen

  1. R.K. Ahuja, K. Mehlhorn, J.B. Orlin, R.E. Tarjan: “Faster Algorithms for the Shortest Path Problem (An Extended Abstract)”.

    Google Scholar 

  2. K. Mehlhorn, St. Näher: “A Faster Compaction Algorithm with Automatic Jog Insertion”. Proc. of the 5th MIT Conf. on Adv. Res. in VLSI (1988).

    Google Scholar 

  3. K. Mehlhorn, W. Rülling: “Compaction on the Torus”. SFB-Bericht 04/1988.

    Google Scholar 

  4. W. Rülling: “Spezielle Probleme beim Kompaktieren”. VLSI-Workshop, Gut Ising, Juni 1987.

    Google Scholar 

  5. P. Spirakis, A. Tsakalidis: “A Very Fast, Practical Algorithm for Finding a Negative Cycle in a Digraph”. Proc. of the 13th ICALP (1986)

    Google Scholar 

  6. K. Mehlhorn, B. Schmidt: “On BF-orderable Graphs”. Discrete Applied Mathematics 15, pp. 315–327. (1986)

    Article  MATH  MathSciNet  Google Scholar 

Literatur

  1. M. Brady, D. Brown: “Optimal Multilayer Channel Routing with Overlap”. Proc. of the 4th MIT Conf. on Adv. Res. in VLSI, pp. 281–298 (1986).

    Google Scholar 

  2. B. Berger, M. Brady, D. Brown, F.T. Leighton: “Nearly Optimal Algorithms and Bounds for Multilayer Channel Routing”. Typescript, MIT (1986).

    Google Scholar 

  3. M. Burstein, R. Pelavin: “Hierarchical Wire Routing”. IEEE Transactions on CAD, Vol. CAD-2, No. 4, 1983.

    Google Scholar 

  4. C. van Hoesel: “Routing and Multicommodity Flows in Planar Graph”. Master Thesis, Eindhoven (1986).

    Google Scholar 

  5. C. van Hoesel, A. Schrijver: “Edge-Disjoint Homotopic Paths in a Planar Graph with One Hole”. Technical Report, Amsterdam (1986).

    Google Scholar 

  6. F.T. Leighton: “A Survey of Problems and Results for Channel Routing”. Typescript, MIT (1986).

    Google Scholar 

  7. C. Leiserson, F.M. Maley: “Algorithms for Routing and Testing Routability of Planar VLSI Layouts”. Proc. of the 17th STOC (1985).

    Google Scholar 

  8. F.M. Maley: “Single-Layer Routing”. Dissertation, MIT (1987).

    Google Scholar 

  9. A. Schrijver: “Edge-Disjoint Homotopic Paths in Straight-Line Planar Graphs”. Technical Report, Tilburg University (1987).

    Google Scholar 

  10. A. Schrijver: “Decomposition of Graphs on Surfaces and a Homotopic Circulation Theorem”. Technical Report, Tilburg University (1986).

    Google Scholar 

  11. H. Suzuki, T. Nishizeki, N. Saito: “Multicommodity Flows in Planar Undirected Graphs and Shortest Paths”. Proc. of the 17th STOC (1985).

    Google Scholar 

  12. M. Tompa: “An Optimal Solution to a Wire-Routing Problem”. Journal of Computer and System Siences 23 (1981).

    Google Scholar 

Eigene Veröffentlichungen

  1. S. Gao, M. Jerrum, M. Kaufmann, K. Mehlhorn, W. Rülling, C. Storb: “Continuous Homotopic One-Layer Routing”. Universität des Saarlandes (1987).

    Google Scholar 

  2. S. Gao, M. Kaufmann: “Channel Routing of Multiterminal Nets”. Proc. of the 28th FOCS (1987).

    Google Scholar 

  3. M. Kaufmann: “A Linear-Time Algorithm for Routing in a Convex Grid”. SFB-Bericht 14/1987.

    Google Scholar 

  4. M. Kaufmann: “Uber Lokales Verdrahten von Zwei-Punkt-Netzen”. Dissertation, Universität des Saarlandes (1987).

    Google Scholar 

  5. M. Kaufmann, K. Mehlhorn: “On Local Routing of Two-Terminal Nets”. STACS 87, LNCS Vol., pp.

    Google Scholar 

  6. M. Kaufmann, K. Mehlhorn: “A Linear-Time Algorithm for the Local Routing Problem”. SFB—Bericht (1988).

    Google Scholar 

  7. K. Mehlhorn: “A Faster Approximation Algorithm for the Steiner Problem in Graphs”, IPL, to appear.

    Google Scholar 

  8. N. Müller: “Ein Algorithmus zur Bestimmung einer Globalen Verdrahtung”. Diplomarbeit (1986).

    Google Scholar 

Literatur

  1. Th. Lengauer, St. Näher: “An Analysis of Ternary Simulation as a Tool for Race Detection in Digital MOS Circuits”. Technischer Bericht 37, Universität-Gesamthochschule Paderborn, 1987.

    Google Scholar 

Literatur

  1. K.J. Antreich, M.H. Schulz: “Zur Schnellen Fehlersimulation in Kombinatorischen Schaltungen”. Mitteilung aus dem Lehrstuhl für Rechnergestüztes Entwerfen, TU München (1985).

    Google Scholar 

  2. H. Fujiwara, T. Shimono: “On The Acceleration of Test Generation Algorithms”. IEEE Trans, on Computers, C-32, pp. 1137–1144 (1983).

    Article  Google Scholar 

  3. P. Goel: “An Implicit Enumeration Algorithm to Generate Tests for Combinational Logic Circuits”. IEEE Trans, on Computers, C-30, pp. 215–222 (1981).

    Article  Google Scholar 

  4. A. LaPaugh, R. Lipton: “Total Stuck-at-Fault Testing by Circuit Transformation”. 20th Design Automation Conference, 1983, pp. 713–716.

    Chapter  Google Scholar 

Eigene Veröffentlichungen

  1. N. Blum: “Fehlererkennung in Kombinatorischen Schaltkreisen”. Habilitationsschrift.

    Google Scholar 

  2. W. Rülling: “Design leicht testbarer Schaltungen”. in Vorbereitung.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Fachbereich Informatik, Universität Hamburg, Rothenbaumchaussee 67/69, 2000, Hamburg 13, Deutschland

    Rüdiger Valk

Authors
  1. Rüdiger Valk
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Fachbereich Informatik, Universität Hamburg, Rothenbaumchaussee 67/69, 2000, Hamburg 13, Deutschland

    Rüdiger Valk

Rights and permissions

Reprints and permissions

Copyright information

© 1988 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Valk, R. (1988). SFB 124: VLSI-Entwurfsmethoden und Parallelität. In: Valk, R. (eds) GI — 18. Jahrestagung II. Informatik-Fachberichte, vol 188. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-74135-7_1

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-74135-7_1

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-50360-6

  • Online ISBN: 978-3-642-74135-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics