Zusammenfassung
Bevor in den nachfolgenden Kapiteln einzelne Algorithmen beschrieben und auf die Programmierung eingegangen wird, wiederholt dieses Kapitel einige Grundlagen bei der Analyse von Algorithmen und stellt Kriterien zur Beurteilung der Leistungsfähigkeit vor.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Literatur
Aho AV, Hopcroft JE, Ullmann JD (1974) The design and analysis of computer algorithms. Addison-Wesley, Reading
Bernstein A (1966) Analysis of programs for parallel processing. IEEE Trans Electron Comput EC-15(5):757–763
Casanova H, Legrand A, Robert Y (2009) Parallel algorithms. Chapman & Hall/CRC, Boca Raton
Culler D, Karp R, Patterson D, Sahay A, Schauser KE, Santos E, Subramonian R, von Eicken T (1993) Logp: Towards a realistic model of parallel computation. SIGPLAN Not 28(7):1–12. http://doi.acm.org/10.1145/173284.155333. ISSN 0362-1340
Flynn MJ (1972) Some computer organizations and their effectiveness. IEEE Trans Comput C-21(9):948–960. https://doi.org/10.1109/TC.1972.5009071. ISSN 0018-9340
Gibbons PB (1989) The asynchronous pram: A semisynchronous model for shared-memory mimd machines. PhD thesis, AAI9028835
Grama AY, Gupta A, Kumar V (1993) Isoefficiency: Measuring the scalability of parallel algorithms and architectures. IEEE Parallel Distrib Technol: Syst Appl 1(3): 12–21. https://doi.org/10.1109/88.242438. ISSN 1063-6552
Grama A, Gupta A, Karypis G, Kumar V (2003) Introduction to parallel computing, 2. Aufl. Pearson/Addison Wesley, Harlow
Gustafson JL (1988) Reevaluating Amdahl’s law. Commun ACM 31:532–533. http://doi.acm.org/10.1145/42411.42415. ISSN 0001-0782
Kozen DC (2006) Theory of computation. Springer, London. ISBN 1-84628-297-7/hbk
Knuth DE (1997) The art of computer programming: Seminumerical algorithms (Bd. 2, 3. Aufl.). Addison-Wesley Longman, Upper Saddle River
Reif JH (Hrsg) (1993) Synthesis of parallel algorithms. Morgan Kaufmann, San Mateo
Shi Y (1996) Reevaluating Amdahl’s law and Gustafson’s law. Technical report, Temple University
Valiant LG (1990) A bridging model for parallel computation. Commun ACM 33(8):103–111. http://doi.acm.org/10.1145/79173.79181. ISSN 0001-0782
Wyllie JC (1979) The complexity of parallel computations. Cornell University, Ithaca
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2019 Springer Fachmedien Wiesbaden GmbH, ein Teil von Springer Nature
About this chapter
Cite this chapter
Uelschen, M. (2019). Grundlagen. In: Software Engineering Paralleler Systeme. Springer Vieweg, Wiesbaden. https://doi.org/10.1007/978-3-658-25343-1_2
Download citation
DOI: https://doi.org/10.1007/978-3-658-25343-1_2
Published:
Publisher Name: Springer Vieweg, Wiesbaden
Print ISBN: 978-3-658-25342-4
Online ISBN: 978-3-658-25343-1
eBook Packages: Computer Science and Engineering (German Language)