Skip to main content
SpringerLink
Log in
Book cover

Algorithmik pp 311–358Cite as

Parallelisierung, Nebenläufigkeit und alternative Modelle

oder wie man vieles gleichzeitig schafft

  • Chapter

  • 2107 Accesses

This is a preview of subscription content, 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   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   34.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD   49.99
Price excludes VAT (USA)
  • Durable hardcover 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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Kapitel 10

  1. J. Jaja, An Introduction to Parallel Algorithms, Addison-Wesley, 1992.

    Google Scholar 

  2. F. T. Leighton, Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes, Morgan Kaufmann, 1992.

    Google Scholar 

  3. S. G. Akl, Parallel Computation: Models and Methods, Prentice-Hall, 1996.

    Google Scholar 

  4. M. J. Quinn, Designing Efficient Algorithms for Parallel Computers, McGraw-Hill, 1987.

    Google Scholar 

  5. I. Parberry, Parallel Complexity Theory, John Wiley & Sons, 1987.

    Google Scholar 

  6. A. Gibbons und W. Rytter, Efficient Parallel Algorithms, Cambridge University Press, 1988.

    Google Scholar 

  7. M. Ben-Ari, Principles of Concurrent Programming, Prentice-Hall, 1982.

    Google Scholar 

  8. R. E. Filman und D. P. Friedman, Coordinated Computing: Tools and Techniques for Distributed Software, McGraw-Hill, 1984.

    Google Scholar 

  9. G. R. Andrews, Concurrent Programming: Principles and Practice, Pearson Education, 1991.

    Google Scholar 

  10. N. Lynch, Distributed Algorithms, Morgan Kaufrnann, 1997.

    Google Scholar 

  11. R. Milner, Communication and Concurrency, Prentice-Hall, 1989.

    Google Scholar 

  12. C. A. R. Hoare, Communicating Sequential Processes, Prentice-Hall, 1985.

    Google Scholar 

  13. R. Milner, Communicating and Mobile Systems: The Pi-Calculus, Cambridge University Press, 1999.

    Google Scholar 

  14. K. M. Chandy und J. Misra, Parallel Program Design: A Foundation, Addison-Wesley, 1988.

    Google Scholar 

  15. F. Andre, D. Herman und J.-P. Verjus, Synchronization of Parallel Programs, MIT Press, 1985.

    Google Scholar 

  16. E.V. Krishnammthy, Parallel Processing: Principles and Practice, Addison-Wesley, 1989.

    Google Scholar 

  17. Concurrency Verification: Introduction to Compositional and Noncompositional Methods, W.-P. de Roever et al., Hrsg., Cambridge University Press, 2001.

    Google Scholar 

  18. Algorithms, Software and Hardware of Parallel Computers, V. E. Kotov und J. Miklosko, Hrsg., Springer-Verlag, 1984.

    Google Scholar 

  19. Logics and Models of Concurrent Systems, K. R. Apt, Hrsg., NATO ASI Series, Vol. 13, Springer-Verlag, 1985.

    Google Scholar 

  20. The Origins of Concurrent Programming: From Semaphores to Remote Procedure Calls, P. Brinch Hansen, Hrsg., Springer-Verlag, 2002.

    Google Scholar 

  21. R. W. Hockney und C. R. Jesshope, Parallel Computers 2: Architecture, Programming and Algorithms, 2. Auflage, Adam Hilger Ltd, 1988.

    Google Scholar 

  22. C. P. Williams und S. H. Clearwater, Explorations in Quantum Computing, Springer-Verlag, 1998.

    Google Scholar 

  23. M. A. Nielsen und I. L. Chuang, Quantum Computation and Quantum Information, Cambridge University Press, 2000.

    Google Scholar 

  24. M. Hirvensalo, Quantum Computing, Springer-Verlag, 2000.

    Google Scholar 

  25. C. S. Calude und G. Pãun, Computing with Cells and Atoms: An Introduction to Quantum, DNA and Membrane Computing, Taylor & Francis, 2001.

    Google Scholar 

  26. G. Pãun, G. Rozenberg und A. Salomaa, DNA Computing: New Computing Paradigms, Springer-Verlag, 1998.

    Google Scholar 

  27. M. Sipper, Machine Nature: The Coming Age of Bio-Inspired Computing, McGraw-Hill, 2002.

    Google Scholar 

  28. A. Ehrenfeucht, T. Harju, I. Petre, D. M. Prescott und G. Rozenberg, Computation in Living Cells: Gene Assembly in Ciliates, Springer-Verlag, 2004.

    Google Scholar 

  29. D. Aharonov, „Quantum Computation,“ Annual Reviews of Computational Physics VI, D. Stauffer, Hrsg., World Scientific, 1998.

    Google Scholar 

  30. A. Berthiaume, „Quantum Computation,“ in Complexity Theory Retrospective II, L. A. Hemaspaandra und A. L. Selman, Hrsg., Springer-Verlag, 1997, S. 23–51.

    Google Scholar 

  31. D. P. DiVincenzo, „Quantum Computation,“ Science 270 (1995), S. 255–61.

    MathSciNet  Google Scholar 

  32. S. A. Kurtz, S. R. Mahaney, J. S. Royer und J. Simon, „Biological Computing,“ in Complexity Theory Retrospective II, L. A. Hemaspaandra und A. L. Selman, Hrsg., Springer-Verlag, 1997, S. 179–95.

    Google Scholar 

  33. L. Kari, „DNA Computing: The Arrival of Biological Mathematics,“ The Mathematical Intelligencer 19:2 (1997), S. 9–22.

    Article  MATH  MathSciNet  Google Scholar 

  34. Journal of Parallel and Distributed Computing, abgekürztals. J. Par. Dist. Comput.; herausgegeben von Elsevier.

    Google Scholar 

  35. International Journal of Parallel Programming, abgekürzt als Int. J. Parallel Prog.; herausgegeben von Kluwer/Plenum.

    Google Scholar 

  36. Distributed Computing, abgekürzt als Dist. Comput.; herausgegeben von Springer.

    Google Scholar 

  37. ACM Transactions on Programming Languages and Systems, abgekürzt als ACM Trans. Prog. Lang. Syst. oder mitunter einfach TOPLAS; herausgegeben von der ACM.

    Google Scholar 

  38. Science of Computer Programming, abgekürzt als Sci. Comput. Prog.; herausgegeben von Elsevier.

    Google Scholar 

  39. Software: Practice and Experience, abgekürzt als Softw. Pract. Exp.; herausgegeben von John Wiley & Sons.

    Google Scholar 

  40. Journal of Systems and Software, abgekürzt als J. Syst. Softw.; herausgegeben von Elsevier.

    Google Scholar 

  41. IEEE Transactions on Software Engineering, abgekürzt als IEEE Trans. Soft. Eng.; herausgegeben von der IEEE.

    Google Scholar 

  42. IEEE Transactions on Computers, abgekürzt als IEEE Trans. Comput.; herausgegeben von der IEEE.

    Google Scholar 

  43. IEEE Transactions on Parallel & Distributed Systems, abgekürzt als IEEE Trans. Par. Dist. Syst.; herausgegeben von der IEEE.

    Google Scholar 

  44. Concurrency and Computation: Practice & Experience; herausgegeben von John Wiley & Sons.

    Google Scholar 

  45. Quantum Information & Computation, abgekürzt als Quant. Inf. Comput.; herausgegeben von Rinton Press.

    Google Scholar 

  46. International Journal of Quantum Information, abgekürzt als Int. J. Quant. Inf.; herausgegeben von World Scientific.

    Google Scholar 

  47. Quantum Computers and Computing; herausgegeben von der russischen Akademie der Wissenschaften.

    Google Scholar 

  48. Journal of Computational Biology, abgekürzt als J. Comput. Biol.; herausgegeben von Mary Ann Liebert, Inc.

    Google Scholar 

  49. F. P. Brooks, Jr., The Mythical Man-Month, Addison-Wesley, 1979.

    Google Scholar 

  50. D. E. Knuth, The Art of Computer Programming, Vol. 3: Sorting and Searching, 2. Aufiage, Addison-Wesley, 1998.

    Google Scholar 

  51. D. Bitton, D. J. DeWitt, D. K. Hsaio und J. Menon, „A Taxonomy of Parallel Sorting,“ Comput. Surv. 16 (1984), S. 287–318.

    Article  MATH  Google Scholar 

  52. A. Borodin, „On Relating Time and Space to Size and Depth,“ SIAM J. Comput. 6 (1977), S. 733–44.

    Article  MATH  MathSciNet  Google Scholar 

  53. K. E. Batcher, „Sorting Networks and their Applications,“ Proc. 1968 Spring Joint Comput. Conf., AFIPS Press, S. 307–14, 1968.

    Google Scholar 

  54. M. Ajtai, J. Komlós und E. Szemerédi, „Sorting in clog n Parallel Steps,“ Combinatorica 3 (1983), S. 1–19.

    MATH  MathSciNet  Google Scholar 

  55. T. Leighton, „Tight Bounds on the Complexity of Parallel Sorting,“ IEEE Trans. Comput. C-34 (1985), S. 344–54.

    MathSciNet  Google Scholar 

  56. N. Pippenger, „Communication Networks,“ in Handbook of Theoretical Computer Science, Vol. A, J. van Leeuwen, Hrsg., Elsevier und MIT Press, 1990, S. 805–33.

    Google Scholar 

  57. M. J. Quinn und N. Deo, „Parallel Graph Algorithms,“ Comput. Surv. 16 (1984), S. 319–48.

    Article  MATH  MathSciNet  Google Scholar 

  58. H. T. Kung, „Let’s Design Algorithms for VLSI Systems,“ Proc. Conf. Very Large Scale Integration: Architecture, Design, Fabrication, California Inst. Tech., S. 65–90, 1979.

    Google Scholar 

  59. H. T. Kung und C. E. Leiserson, „Algorithms for VLSI Processor Arrays,“ in Introduction to VLSI Systems, C. Mead und L. Conway, Hrsg., Addison-Wesley, 1980, S. 271–92.

    Google Scholar 

  60. H. T. Kung, „Why Systolic Architectures?“ Computer 15–1 (1982), S. 37–46.

    Google Scholar 

  61. P. M. B. Vitányi, „Locality, Communication and Interconnect Length in Multicomputers,“ SIAM J. Comput. 17 (1988), S. 659–72.

    Article  MATH  MathSciNet  Google Scholar 

  62. A. K. Chandra und L. J. Stockmyer, „Alternation,“ Proc. 17th IEEE Symp. on Foundations of Computer Science, IEEE Press, S. 98–108, 1976.

    Google Scholar 

  63. L. M. Goldschlager, „A Universal Interconnection Pattern for Parallel Computers,“ J. Assoc. Comput. Mach. 29 (1982), S. 1073–86.

    MATH  MathSciNet  Google Scholar 

  64. V. R. Pratt und L. J. Stockmeyer, „A Characterization of the Power of Vector Machines,“ J. Comput. Syst. Sci. 12 (1976), S. 198–221.

    MATH  MathSciNet  Google Scholar 

  65. N. Pippenger, „On Simultaneous Resource Bounds (preliminary version),“ Proc. 20th IEEE Symp. on Foundations of Computer Science, IEEE Press, S. 307–11,1979.

    Google Scholar 

  66. S. A. Cook, „Towards a Complexity Theory of Synchronous Parallel Computation,“ L’Enseignement Mathématique 27 (1981), S. 99–124.

    MATH  Google Scholar 

  67. S. A. Cook, „A Taxonomy of Problems with Fast Parallel Algorithms,“ Inf. and Cont. 64 (1985), S. 2–22.

    Article  MATH  Google Scholar 

  68. D. S. Johnson, „A Catalog of Complexity Classes,“ in Handbook of Theoretical Computer Science, Vol. A, J. van Leeuwen, Hrsg., Elsevier und MIT Press, 1990, S. 67–161.

    Google Scholar 

  69. R. M. Karp und V. Ramachandran, „Parallel Algorithms for Shared-Memory Machines,“ in Handbook of Theoretical Computer Science, Vol. A, J. van Leeuwen, Hrsg., Elsevier und MIT Press, 1990, S. 869–941.

    Google Scholar 

  70. G. L. Peterson, „Myths about the Mutual Exclusion Problem,“ Inf. Proc. Lett. 12 (1981), S. 115–16.

    Article  MATH  Google Scholar 

  71. L. Lamport, „Proving the Correctness of Multiprocess Programs,“ IEEE Trans. Soft. Eng. SE-3 (1977), S. 125–43.

    MathSciNet  Google Scholar 

  72. S. Owicki und L. Lamport, „Proving Liveness Properties of Concurrent Programs,“ ACM Trans. Prog. Lang. Syst. 4 (1982), S. 455–95.

    Article  MATH  Google Scholar 

  73. S. Owicki und D. Gries, „Verifying Properties of Parallel Programs: An Axiomatic Approach,“ Comm. Assoc. Comput. Mach. 19 (1976), S. 279–85.

    MATH  MathSciNet  Google Scholar 

  74. K. R. Apt, N. Francez und W. P. de Roever, „A Proof System for Communicating Sequential Processes,“ ACM Trans. Prog. Lang. Syst. 2 (1980), S. 359–85.

    Article  MATH  Google Scholar 

  75. J. Misra und K. M. Chandy, „Proofs of Networks of Processes,“ IEEE Trans. Soft. Eng. SE-7 (1981), S. 417–26.

    MathSciNet  Google Scholar 

  76. L. Lamport und N. Lynch, „Distributed Computing: Models and Methods,“ in Handbook of Theoretical Computer Science, Vol. A, J. van Leeuwen, Hrsg., Elsevier und MIT Press, 1990, S. 1157–99.

    Google Scholar 

  77. A. Pnueli, „The Temporal Semantics of Concurrent Programs,“ Theor. Comput. Sci. 13 (1981), S. 45–60.

    Article  MATH  MathSciNet  Google Scholar 

  78. Z. Manna und A. Pnueli, The Temporal Logic of Reactive and Concurrent Systems: Specification, Springer-Verlag, 1992.

    Google Scholar 

  79. D. M. Gabbay, I. Hodkinson und M. Reynolds, Temporal Logic: Mathematical Foundations and Computational Aspects, Vol. 1, Oxford University Press, 1994.

    Google Scholar 

  80. D. M. Gabbay, M. A. Reynolds und M. Finger, Temporal Logic: Mathematical Foundations and Computational Aspects, Vol. 2, Oxford University Press, 2000.

    Google Scholar 

  81. A. Pnueli, „Applications of Temporal Logic to the Specification and Verification of Reactive Systems: A Survey of Current Trends,“ in Current Trends in Concurrency, J. de Bakker et al., Hrsg., Lecture Notes in Computer Science, Vol. 224, Springer-Verlag, S. 510–84,1986.

    Google Scholar 

  82. E. A. Emerson, „Temporal and Modal Logic,“ in Handbook of Theoretical Computer Science, Vol. B, J. van Leeuwen, Hrsg., Elsevier und MIT Press, 1990, S. 995–1072.

    Google Scholar 

  83. V. R. Pratt, „Modelling Concurrency with Partial Orders,“ Int. J. Parallel Prog. 15 (1986), S. 33–71.

    Article  MATH  MathSciNet  Google Scholar 

  84. E. M. Clarke, E. A. Emerson und A. P. Sistla, „Automatic Verification of Finite-State Concurrent Systems Using Temporal Logic Specifications,“ ACM Trans. Prog. Lang. Syst. 8 (1986), S. 244–63.

    Article  MATH  Google Scholar 

  85. E. M. Clarke, O. Grumberg und D. A. Peled, Model Checking, MIT Press, 2000.

    Google Scholar 

  86. R. P. Kurshan, Computer-Aided Verification of Coordinating Processes: The Automata-Theoretic Approach, Princeton University Press, 1995.

    Google Scholar 

  87. N. Francez, Fairness, Springer-Verlag, 1986.

    Google Scholar 

  88. E. W. Dijkstra, „Hierarchical Ordering of Sequential Processes,“ Acta Inf. 1 (1971), S. 115–38.

    Article  MathSciNet  Google Scholar 

  89. N. A. Lynch, „Fast Allocation of Nearby Resources in a Distributed System,“ Proc. 12th ACM Symp. on Theory of Computing, ACM Press, S. 70–81, 1980.

    Google Scholar 

  90. G. R. Andrews und F. B. Schneider, „Concepts and Notations for Concurrent Programming,“ Comput. Surv. 15 (1983), S. 3–43.

    Article  MATH  Google Scholar 

  91. R. Milner, A Calculus of Communicating Systems, Springer-Verlag, 1980.

    Google Scholar 

  92. C. A. R. Hoare, Communicating Sequential Processes, Prentice-Hall, 1985.

    Google Scholar 

  93. E. W. Dijkstra, „Cooperating Sequential Processes,“ in Programming Languages, F. Ge-nuys, Hrsg., Academic Press, 1968.

    Google Scholar 

  94. C. Bennett, „Logical Reversibility of Computation,“ IBM J. Research and Development 17 (1973), S. 525–32.

    Article  MATH  Google Scholar 

  95. P. Benioff, „The Computer as a Physical System: A Microscopic Quantum Mechanical Hamiltonian Model of Computers as Represented by Turing Machines,“ J. Stat. Phys. 22 (1980), S. 563–91.

    Article  MathSciNet  Google Scholar 

  96. R. Feynman, „Quantum Mechanical Computers,“ Optics News 11 (1985), S. 11–20.

    Google Scholar 

  97. D. Deutsch, „Quantum Theory, the Church-Turing Principle, and the Universal Quantum Computer,“ Proc. R. Soc. London A400 (1985), S. 97–117.

    MathSciNet  Google Scholar 

  98. R. Josza, „Characterizing Classes of Functions Computable by Quantum Parallelism,“ Proc. R. Soc. London A435 (1991), S. 563–74.

    Google Scholar 

  99. L. Grover, „A Fast Quantum Mechanical Algorithm for Database Search,“ Proc. 28th Ann. ACM Symp. on Theory of Computing, ACM Press, S. 212–19, 1996.

    Google Scholar 

  100. P. Shor, „Algorithms for Quantum Computation: Discrete Logarithms and Factoring,“ Proc. 35th IEEE Ann. Symp. on Foundations of Computer Science, IEEE Press, S. 124–34, 1994.

    Google Scholar 

  101. P. Shor, „Polynomial-time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer,“ SIAM J. Comp. 26 (1997), S. 1484–509.

    Article  MATH  MathSciNet  Google Scholar 

  102. D. Simon, „On the Power of Quantum Computation,“ Proc. 35th Ann. IEEE Symp. on Foundations of Computer Science, IEEE Press, S. 116–23, 1994.

    Google Scholar 

  103. E. Knill, R. Laflamme, R. Martinez und C.-H. Tseng, „An Algorithmic Benchmark for Quantum Information Processing,“ Nature 404 (2000), S. 368–70.

    Article  Google Scholar 

  104. L. M. Adelman, „Molecular Computation of Solutions to Combinatorial Problems,“ Science 266 (1994), S. 1021–4.

    Article  Google Scholar 

  105. L. M. Adelman, „Computing with DNA,“ Scientific American 279:2 (1998), S. 54–61.

    Article  MathSciNet  Google Scholar 

  106. R. J. Lipton, „DNA Solution of Hard Computational Problems,“ Science 268 (1994), s. 542–5.

    Google Scholar 

  107. E. Baum, „Building an Associative Memory Vastly Larger Than the Brain,“ Science 268 (1995), S. 583–5.

    Google Scholar 

Download references

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

(2006). Parallelisierung, Nebenläufigkeit und alternative Modelle. In: Algorithmik. Springer, Berlin, Heidelberg . https://doi.org/10.1007/3-540-37437-X_10

Download citation

Publish with us

Policies and ethics

Search

Navigation