Skip to main content
SpringerLink
Log in

Effizienz Paralleler Rechner

  • Conference paper
GI - 10. Jahrestagung

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

Zusammenfassung

Dieser Aufsatz gibt einen informalen und gerafften überblick über einige Ergebnisse aus [PV 79] und [GP 80]. Er beschäftigt sich mit der Frage, wie man einen Computer mit sehr vielen Prozessen verdrahten soll.

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 54.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 69.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

  1. Aho, Hopcraft and Ullman: the design and analysis of computer algorithms, Addison-Wesley 1974

    MATH  Google Scholar 

  2. Batcher: sorting networks and their applications, proc. AFIPS spring joint computer conference, vol. 32, 307–314, 1968

    Google Scholar 

  3. Galil and Paul: a theory of complexity of parallel computation, preprint Tel Aviv University und Universität Bielefeld, 1980

    Google Scholar 

  4. Knuth: sorting and searching, Addison-Wesley 1973

    Google Scholar 

  5. Paul and Reischuk: a graph theoretic approach to determinism versas nondeterminism, erscheint in ACTA INFORMATICA

    Google Scholar 

  6. Paul and Reischuk: on time versas space II, proc. 20th IEEE-FOCS, 298–306, 1979

    Google Scholar 

  7. Preparata and Vuillemin: the cube-connected-cycles: a versatile network for parallel computation, proc. 20th IEEE-FOCS, 140–147, 1979

    Google Scholar 

  8. Waksman: a permutation network, J. ACM 15, 159–163, 1968

    Article  MathSciNet  MATH  Google Scholar 

  9. Lev, Pippenger and Valiant: a fast parallel algorithm for routing in permutation networks, erscheint in IEEE-TC.

    Google Scholar 

Download references

Authors
  1. Z. Galil
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. W. Paul
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Fachbereich 10 - Angewandte Mathematik und Informatik, Universität des Saarlandes, 6600, Saarbrücken, Deutschland

    R. Wilhelm

Rights and permissions

Reprints and permissions

Copyright information

© 1980 Springer-Verlag Berlin · Heidelberg

About this paper

Cite this paper

Galil, Z., Paul, W. (1980). Effizienz Paralleler Rechner. In: Wilhelm, R. (eds) GI - 10. Jahrestagung. Informatik-Fachberichte, vol 33. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-67838-7_4

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-67838-7_4

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-10388-2

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation