Software Engineering paralleler Systeme: Grundlagen, Algorithmen, Programmierung
Gespeichert in:
1. Verfasser: | |
---|---|
Format: | Buch |
Sprache: | German |
Veröffentlicht: |
Wiesbaden
Springer Vieweg
[2019]
|
Schriftenreihe: | Lehrbuch
|
Schlagworte: | |
Online-Zugang: | Inhaltstext http://www.springer.com/ Inhaltsverzeichnis |
Beschreibung: | XI, 405 Seiten Illustrationen, Diagramme (teilweise farbig) 24 cm x 16.8 cm |
ISBN: | 9783658253424 3658253428 |
Internformat
MARC
LEADER | 00000nam a2200000 c 4500 | ||
---|---|---|---|
001 | BV045481112 | ||
003 | DE-604 | ||
005 | 20210727 | ||
007 | t | ||
008 | 190220s2019 gw a||| |||| 00||| ger d | ||
015 | |a 19,N04 |2 dnb | ||
016 | 7 | |a 1175572195 |2 DE-101 | |
020 | |a 9783658253424 |c circa EUR 34.99 (DE), circa EUR 35.97 (AT), circa CHF 39.00 (freier Preis) |9 978-3-658-25342-4 | ||
020 | |a 3658253428 |9 3-658-25342-8 | ||
024 | 3 | |a 9783658253424 | |
035 | |a (OCoLC)1083222058 | ||
035 | |a (DE-599)DNB1175572195 | ||
040 | |a DE-604 |b ger |e rda | ||
041 | 0 | |a ger | |
044 | |a gw |c XA-DE-HE | ||
049 | |a DE-384 |a DE-739 |a DE-Aug4 |a DE-11 | ||
084 | |a ST 230 |0 (DE-625)143617: |2 rvk | ||
084 | |a 004 |2 sdnb | ||
100 | 1 | |a Uelschen, Michael |d ca. 20./21. Jh. |e Verfasser |0 (DE-588)1193191254 |4 aut | |
245 | 1 | 0 | |a Software Engineering paralleler Systeme |b Grundlagen, Algorithmen, Programmierung |c Michael Uelschen |
264 | 1 | |a Wiesbaden |b Springer Vieweg |c [2019] | |
264 | 4 | |c © 2019 | |
300 | |a XI, 405 Seiten |b Illustrationen, Diagramme (teilweise farbig) |c 24 cm x 16.8 cm | ||
336 | |b txt |2 rdacontent | ||
337 | |b n |2 rdamedia | ||
338 | |b nc |2 rdacarrier | ||
490 | 0 | |a Lehrbuch | |
650 | 0 | 7 | |a Parallelverarbeitung |0 (DE-588)4075860-6 |2 gnd |9 rswk-swf |
650 | 0 | 7 | |a Software Engineering |0 (DE-588)4116521-4 |2 gnd |9 rswk-swf |
650 | 0 | 7 | |a Softwareentwicklung |0 (DE-588)4116522-6 |2 gnd |9 rswk-swf |
653 | |a Embedded Systems | ||
653 | |a Funktionale Programmiersprachen | ||
653 | |a GPU | ||
653 | |a Grundlagen der Softwareentwicklung | ||
653 | |a Manycore | ||
653 | |a Michael Uelschen | ||
653 | |a Multicore | ||
653 | |a Parallele Algorithmen | ||
653 | |a Parallele Programmierung | ||
653 | |a Software Engineering Buch | ||
653 | |a Software Engineering Paralleler Systeme | ||
653 | |a UY | ||
653 | |a UT | ||
655 | 7 | |0 (DE-588)4123623-3 |a Lehrbuch |2 gnd-content | |
689 | 0 | 0 | |a Software Engineering |0 (DE-588)4116521-4 |D s |
689 | 0 | 1 | |a Parallelverarbeitung |0 (DE-588)4075860-6 |D s |
689 | 0 | 2 | |a Softwareentwicklung |0 (DE-588)4116522-6 |D s |
689 | 0 | |5 DE-604 | |
710 | 2 | |a Springer Fachmedien Wiesbaden |0 (DE-588)1043386068 |4 pbl | |
776 | 0 | 8 | |i Erscheint auch als |n Online-Ausgabe |z 978-3-658-25343-1 |
856 | 4 | 2 | |m X:MVB |q text/html |u http://deposit.dnb.de/cgi-bin/dokserv?id=393d57224d9b4e1dadecbe4c754a0803&prov=M&dok_var=1&dok_ext=htm |3 Inhaltstext |
856 | 4 | 2 | |m X:MVB |u http://www.springer.com/ |
856 | 4 | 2 | |m Digitalisierung UB Passau - ADAM Catalogue Enrichment |q application/pdf |u http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=030866189&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |3 Inhaltsverzeichnis |
999 | |a oai:aleph.bib-bvb.de:BVB01-030866189 |
Datensatz im Suchindex
_version_ | 1804179399216463872 |
---|---|
adam_text | 1 Einleitung............................................................................................................ 1.1 Herausforderungen.................................................................................... 1.1.1 Technologische Entwicklungen.................................................. 1.1.2 Konsequenzen für das Software Engineering............................ 1.2 Begriffsdefinition...................................................................................... 1.3 Aufbau und Gliederung........................................................................... 1.3.1 Ziele des Buches........................................................................ 1.3.2 Voraussetzungen........................................................................ 1.3.3 Gliederung.................................................................................. Literatur................................................................................................................ 1 1 2 11 12 13 13 13 14 15 2 Grundlagen........................................................................................................ 2.1 Asymptotische Analyse............................................................................. 2.2 Theoretisches Modell................................................................................ 2.2.1 Sequenzielle Registermaschine................................................... 2.2.2 Pseudocode................................................................................ 2.2.3 Beispielalgorithmus: Das Sieb
desEratosthenes......................... 2.2.4 Parallele Registermaschine........................................................ 2.2.5 Paralleler Speicherzugriff.......................................................... 2.2.6 Kommunikation paralleler Maschinenmodelle.......................... 2.3 Rechnernetze............................................................................................ 2.4 Taxonomie nach Flynn.............................................................................. 2.5 Leistungsmerkmale.................................................................................. 2.5.1 Kennzahlen................................................................................ 2.5.2 Isoeffizienz.................................................................................. 2.5.3 Beispiel: Analyse der parallelen Maximumsuche...................... 2.6 Gesetze von Amdahl und Gustafson........................................................ 2.7 Lemma von Brent....................................... 17 18 20 20 21 22 24 24 26 29 32 33 34 36 39 41 43 VII
VIII Inhaltsverzeichnis 2.8 3 Parallelisierung......................................................................................... 2.8.1 Abhängigkeiten.......................................................................... 2.8.2 Testverfahren.............................................................................. Literatur................................................................................................................ 47 47 50 53 ParalleleSysteme............................................................................................... 3.1 Einleitung.................................................................................................. 3.1.1 Parallelisierung auf Bitebene...................................................... 3.1.2 Von Neumann-Rechnerarchitektur............................................ 3.2 Parallelisierung auf Befehlsebene............................................................ 3.2.1 Befehlspipeline.......................................................................... 3.2.2 Superskalarität............................................................................ 3.2.3 Multithreading............................................................................ 3.2.4 Vektorisierung............................................................................ 3.3 Speicherhierarchie.................................................................................... 3.3.1 Cache-Speicher.......................................................................... 3.3.2 Rechensysteme mit gemeinsamem
Hauptspeicher.................... 3.4 Kohärenz.................................................................................................. 3.4.1 Kohärenzprotokolle.................................................................... 3.4.2 False Sharing.............................................................................. 3.5 NUMA-Architektur.................................................................................. 3.6 Speichermodell........................................................................................ 3.6.1 Motivation.................................................................................. 3.6.2 Wettlaufbedingung...................................................................... 3.6.3 Sequenzielle Konsistenz............................................................ 3.6.4 Konsistenzmodelle...................................................................... 3.6.5 Atomare Variablen...................................................................... 3.6.6 Weitere Beispiele........................................................................ 3.6.7 Atomare Operationen.................................................................. 3.7 Sperrenfreie Datenstrukturen.................................................................... 3.7.1 Warteschlange............................................................................ 3.7.2 Das ABA-Problem...................................................................... 3.7.3 Dynamische Speicherverwaltung mit Hazard-Verweisen.......... 3.8 Eingebettete
Systeme................................................................................ 3.8.1 Parallax P8X32A........................................................................ 3.8.2 Adapteva Epiphany.................................................................... 3.8.3 Espressif Systems ESP32.......................................................... 3.8.4 XMOSxCore.............................................................................. 3.8.5 Nvidia Tegra 2............................................................................ 3.8.6 NXP І.МХ7................................................................................ Literatur................................................................................................................ 55 55 56 59 62 62 64 65 66 71 71 77 78 78 84 86 90 90 93 94 97 104 107 110 112 112 116 117 120 121 122 122 124 124 126 127 Inhaltsverzeichnis 4 Algorithmen........................................................................................................ 4.1 Entwurf von Algorithmen........................................................................ 4.1.1 PCAM-Methode........................................................................ 4.1.2 Parallele Dekomposition............................................................ 4.1.3 Skalierbarkeit durch kleine Einheiten........................................ 4.2 Horner-Schema........................................................................................ 4.2.1 Sequenzielles Verfahren.............................................................. 4.2.2
Parallelisierung des Wellenfront-Musters.................................. 4.3 Polytop-Modell........................................................................................ 4.3.1 Einleitung.................................................................................... 4.3.2 Transformation............................................................................ 4.3.3 Fourier-Motzkin-Elimination...................................................... 4.3.4 Sortieren durch Vertauschen (Bubblesort).................................. 4.4 Pointer-Jumping........................................................................................ 4.5 Präfixsummen und Reduktionsalgorithmen.............................................. 4.5.1 Basisoperationen........................................................................ 4.5.2 Kostenoptimale Reduktion........................................................ 4.5.3 Algorithmen zur Berechnung der Präfixsumme........................ 4.5.4 Erweiterte Operationen.............................................................. 4.5.5 Rekursionsgleichungen.............................................................. 4.6 Sortierverfahren........................................................................................ 4.6.1 Sortieren durch Mischen............................................................ 4.6.2 Sortiernetzwerke........................................................................ 4.6.3 Odd-Even-Transposition-Sortiernetzwerk.................................. 4.6.4 Bitonisches
Sortiernetzwerk...................................................... 4.7 Rekursive Suchverfahren.......................................................................... 4.7.1 Rekursion.................................................................................... 4.7.2 Entscheidungsprobleme.............................................................. 4.8 Matrizenmultiplikation............................................................................ 4.8.1 Einleitung.................................................................................... 4.8.2 Verfahren von Cannon................................................................ 4.8.3 SUMMA-Algorithmus................................................................ 4.9 Mustererkennung in Zeichenketten.......................................................... 4.9.1 Einleitung.................................................................................... 4.9.2 Periodizität.................................................................................. 4.9.3 Vishkin-Algorithmus für aperiodische Muster.......................... 4.10 Map-Reduce.............................................................................................. 4.10.1 Idee............................................................................................ 4.10.2 Verteilter Algorithmus von Google............................................ 4.10.3 Beispiel Textanalyse.................................................................. 4.10.4 Beispiel
PageRank...................................................................... Literatur................................................................................................................ IX 129 130 130 135 136 138 139 141 142 142 146 147 150 155 157 159 160 163 168 172 181 181 187 190 190 196 197 200 207 207 209 212 217 217 217 219 222 222 222 223 225 230
X 5 6 Inhaltsverzeichnis CPU - Programmierung................................................................................................ 5.1 C++-Standardbibliothek..................................................................................... 5.1.1 Allgemeines......................................................................................... 5.1.2 Lambda-Ausdrücke............................................................................ 5.1.3 Zeitmessung......................................................................................... 5.1.4 Thread-Funktionalität....................................................................... 5.1.5 Asynchrone Task-Programmierung................................................. 5.1.6 Parallele Algorithmen....................................................................... 5.1.7 Speicherausrichtung............................................................................ 5.2 POSIX Threads.................................................................................................. 5.2.1 Einleitung............................................................................................. 5.2.2 Affinität................................................................................................ 5.3 Threading Building Blocks.............................................................................. 5.3.1 Einleitung............................................................................................. 5.3.2 Parallele
Schleifen.............................................................................. 5.3.3 Reduktion und Präfixsumme............................................................ 5.3.4 Task-Parallelität.................................................................................. 5.3.5 Dynamische Lastverteilung.............................................................. 5.3.6 Erweitere Task-Konzepte................................................................... 5.4 OpenMP............................................................................................................... 5.4.1 Funktionsweise.................................................................................. 5.4.2 Datenparallelität.................................................................................. 5.4.3 Task-Parallelität.................................................................................. 5.4.4 Das n-Damenproblem....................................................................... Literatur............................................................................................................................ 231 231 231 233 242 245 249 257 261 265 266 267 272 272 273 278 283 291 294 305 305 308 308 309 312 GPU-Programmierung................................................................................................ 6.1 Einleitung............................................................................................................. 6.2 Entwicklung der Grafikkarte............................................................................ 6.3
Aufbau modernen Grafikkarten....................................................................... 6.4 Hardware-Architektur....................................................................................... 6.5 Speicherhierarchie............................................................................................. 6.5.1 Speichertypen..................................................................................... 6.6 Software-Architektur und Programmiermodell............................................ 6.6.1 Synchronisierung von Threads........................................................ 6.7 Beispiele............................................................................................................... 6.7.1 Sobel-Operator..................................................................................... 6.7.2 Bitonischer Sortierer......................................................................... 313 313 314 314 316 318 319 321 322 323 323 328 Inhaltsverzeichnis XI 6.8 C++-Bibliothek Thrust....................................................................................... 6.8.1 Motivation........................................................................................... 6.8.2 Container............................................................................................. 6.8.3 Algorithmen......................................................................................... 6.9 Andere Konzepte................................................................................................
Literatur............................................................................................................................. 334 334 335 337 339 359 Moderne Programmiersprachen............................................................................... 7.1 Funktionale Programmierung mit Scala........................................................ 341 342 7.1.1 Gmndsätzliches.................................................................................. 7.1.2 Ausdrücke und Werte.......................................................................... 7.1.3 Funktionen........................................................................................... 7.1.4 Funktionen höherer Ordnung............................................................ 7.1.5 Listen.................................................................................................... 7.1.6 Standardfunktionen............................................................................ 7.1.7 Klassen.................................................................................................. 7.1.8 case-classes......................................................................................... 7.1.9 Weitere Konzepte in Scala................................................................. 7.1.10 Beispiel: Textanalyse......................................................................... 7.2 Das Aktorenmodell........................................................................................... 7.2.1
Motivation........................................................................................... 7.2.2 Was ist das Problem mit Threads?................................................... 7.2.3 Bausteine des Aktorenmodells.......................................................... 7.2.4 Aktorenmodell mit Akka................................................................... 7.2.5 Beispiel: Bank..................................................................................... Literatur............................................................................................................................. 342 342 344 348 350 354 356 358 359 364 367 367 367 370 371 372 378 Parallele Projekte......................................................................................................... 8.1 Langford-Sequenz............................................................................................. 8.2 Tatami-Parkettierung......................................................................................... 8.3 Die Steppdecke von Mrs. Perkins................................................................... 8.4 Zellulärer Automat............................................................................................. 8.5 SOGO-Spiel......................................................................................................... 8.6 Quadratischer Baum........................................................................................... 8.7
Zeitreihenanalyse................................................................................................ 8.8 Rätsel Nr. 244...................................................................................................... Literatur............................................................................................................................. 379 380 382 384 386 387 389 392 393 394 Bildnachweis........................................................................................................................ 395 Stichwortverzeichnis 397 7 8
|
any_adam_object | 1 |
author | Uelschen, Michael ca. 20./21. Jh |
author_GND | (DE-588)1193191254 |
author_facet | Uelschen, Michael ca. 20./21. Jh |
author_role | aut |
author_sort | Uelschen, Michael ca. 20./21. Jh |
author_variant | m u mu |
building | Verbundindex |
bvnumber | BV045481112 |
classification_rvk | ST 230 |
ctrlnum | (OCoLC)1083222058 (DE-599)DNB1175572195 |
discipline | Informatik |
format | Book |
fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>02775nam a2200673 c 4500</leader><controlfield tag="001">BV045481112</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20210727 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">190220s2019 gw a||| |||| 00||| ger d</controlfield><datafield tag="015" ind1=" " ind2=" "><subfield code="a">19,N04</subfield><subfield code="2">dnb</subfield></datafield><datafield tag="016" ind1="7" ind2=" "><subfield code="a">1175572195</subfield><subfield code="2">DE-101</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9783658253424</subfield><subfield code="c">circa EUR 34.99 (DE), circa EUR 35.97 (AT), circa CHF 39.00 (freier Preis)</subfield><subfield code="9">978-3-658-25342-4</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">3658253428</subfield><subfield code="9">3-658-25342-8</subfield></datafield><datafield tag="024" ind1="3" ind2=" "><subfield code="a">9783658253424</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)1083222058</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)DNB1175572195</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rda</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">ger</subfield></datafield><datafield tag="044" ind1=" " ind2=" "><subfield code="a">gw</subfield><subfield code="c">XA-DE-HE</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-384</subfield><subfield code="a">DE-739</subfield><subfield code="a">DE-Aug4</subfield><subfield code="a">DE-11</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">ST 230</subfield><subfield code="0">(DE-625)143617:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">004</subfield><subfield code="2">sdnb</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Uelschen, Michael</subfield><subfield code="d">ca. 20./21. Jh.</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)1193191254</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Software Engineering paralleler Systeme</subfield><subfield code="b">Grundlagen, Algorithmen, Programmierung</subfield><subfield code="c">Michael Uelschen</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Wiesbaden</subfield><subfield code="b">Springer Vieweg</subfield><subfield code="c">[2019]</subfield></datafield><datafield tag="264" ind1=" " ind2="4"><subfield code="c">© 2019</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">XI, 405 Seiten</subfield><subfield code="b">Illustrationen, Diagramme (teilweise farbig)</subfield><subfield code="c">24 cm x 16.8 cm</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="490" ind1="0" ind2=" "><subfield code="a">Lehrbuch</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Parallelverarbeitung</subfield><subfield code="0">(DE-588)4075860-6</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Software Engineering</subfield><subfield code="0">(DE-588)4116521-4</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Softwareentwicklung</subfield><subfield code="0">(DE-588)4116522-6</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Embedded Systems</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Funktionale Programmiersprachen</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">GPU</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Grundlagen der Softwareentwicklung</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Manycore</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Michael Uelschen</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Multicore</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Parallele Algorithmen</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Parallele Programmierung</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Software Engineering Buch</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Software Engineering Paralleler Systeme</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">UY</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">UT</subfield></datafield><datafield tag="655" ind1=" " ind2="7"><subfield code="0">(DE-588)4123623-3</subfield><subfield code="a">Lehrbuch</subfield><subfield code="2">gnd-content</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Software Engineering</subfield><subfield code="0">(DE-588)4116521-4</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="1"><subfield code="a">Parallelverarbeitung</subfield><subfield code="0">(DE-588)4075860-6</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="2"><subfield code="a">Softwareentwicklung</subfield><subfield code="0">(DE-588)4116522-6</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="710" ind1="2" ind2=" "><subfield code="a">Springer Fachmedien Wiesbaden</subfield><subfield code="0">(DE-588)1043386068</subfield><subfield code="4">pbl</subfield></datafield><datafield tag="776" ind1="0" ind2="8"><subfield code="i">Erscheint auch als</subfield><subfield code="n">Online-Ausgabe</subfield><subfield code="z">978-3-658-25343-1</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="m">X:MVB</subfield><subfield code="q">text/html</subfield><subfield code="u">http://deposit.dnb.de/cgi-bin/dokserv?id=393d57224d9b4e1dadecbe4c754a0803&prov=M&dok_var=1&dok_ext=htm</subfield><subfield code="3">Inhaltstext</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="m">X:MVB</subfield><subfield code="u">http://www.springer.com/</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="m">Digitalisierung UB Passau - ADAM Catalogue Enrichment</subfield><subfield code="q">application/pdf</subfield><subfield code="u">http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=030866189&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA</subfield><subfield code="3">Inhaltsverzeichnis</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-030866189</subfield></datafield></record></collection> |
genre | (DE-588)4123623-3 Lehrbuch gnd-content |
genre_facet | Lehrbuch |
id | DE-604.BV045481112 |
illustrated | Illustrated |
indexdate | 2024-07-10T08:19:15Z |
institution | BVB |
institution_GND | (DE-588)1043386068 |
isbn | 9783658253424 3658253428 |
language | German |
oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-030866189 |
oclc_num | 1083222058 |
open_access_boolean | |
owner | DE-384 DE-739 DE-Aug4 DE-11 |
owner_facet | DE-384 DE-739 DE-Aug4 DE-11 |
physical | XI, 405 Seiten Illustrationen, Diagramme (teilweise farbig) 24 cm x 16.8 cm |
publishDate | 2019 |
publishDateSearch | 2019 |
publishDateSort | 2019 |
publisher | Springer Vieweg |
record_format | marc |
series2 | Lehrbuch |
spelling | Uelschen, Michael ca. 20./21. Jh. Verfasser (DE-588)1193191254 aut Software Engineering paralleler Systeme Grundlagen, Algorithmen, Programmierung Michael Uelschen Wiesbaden Springer Vieweg [2019] © 2019 XI, 405 Seiten Illustrationen, Diagramme (teilweise farbig) 24 cm x 16.8 cm txt rdacontent n rdamedia nc rdacarrier Lehrbuch Parallelverarbeitung (DE-588)4075860-6 gnd rswk-swf Software Engineering (DE-588)4116521-4 gnd rswk-swf Softwareentwicklung (DE-588)4116522-6 gnd rswk-swf Embedded Systems Funktionale Programmiersprachen GPU Grundlagen der Softwareentwicklung Manycore Michael Uelschen Multicore Parallele Algorithmen Parallele Programmierung Software Engineering Buch Software Engineering Paralleler Systeme UY UT (DE-588)4123623-3 Lehrbuch gnd-content Software Engineering (DE-588)4116521-4 s Parallelverarbeitung (DE-588)4075860-6 s Softwareentwicklung (DE-588)4116522-6 s DE-604 Springer Fachmedien Wiesbaden (DE-588)1043386068 pbl Erscheint auch als Online-Ausgabe 978-3-658-25343-1 X:MVB text/html http://deposit.dnb.de/cgi-bin/dokserv?id=393d57224d9b4e1dadecbe4c754a0803&prov=M&dok_var=1&dok_ext=htm Inhaltstext X:MVB http://www.springer.com/ Digitalisierung UB Passau - ADAM Catalogue Enrichment application/pdf http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=030866189&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA Inhaltsverzeichnis |
spellingShingle | Uelschen, Michael ca. 20./21. Jh Software Engineering paralleler Systeme Grundlagen, Algorithmen, Programmierung Parallelverarbeitung (DE-588)4075860-6 gnd Software Engineering (DE-588)4116521-4 gnd Softwareentwicklung (DE-588)4116522-6 gnd |
subject_GND | (DE-588)4075860-6 (DE-588)4116521-4 (DE-588)4116522-6 (DE-588)4123623-3 |
title | Software Engineering paralleler Systeme Grundlagen, Algorithmen, Programmierung |
title_auth | Software Engineering paralleler Systeme Grundlagen, Algorithmen, Programmierung |
title_exact_search | Software Engineering paralleler Systeme Grundlagen, Algorithmen, Programmierung |
title_full | Software Engineering paralleler Systeme Grundlagen, Algorithmen, Programmierung Michael Uelschen |
title_fullStr | Software Engineering paralleler Systeme Grundlagen, Algorithmen, Programmierung Michael Uelschen |
title_full_unstemmed | Software Engineering paralleler Systeme Grundlagen, Algorithmen, Programmierung Michael Uelschen |
title_short | Software Engineering paralleler Systeme |
title_sort | software engineering paralleler systeme grundlagen algorithmen programmierung |
title_sub | Grundlagen, Algorithmen, Programmierung |
topic | Parallelverarbeitung (DE-588)4075860-6 gnd Software Engineering (DE-588)4116521-4 gnd Softwareentwicklung (DE-588)4116522-6 gnd |
topic_facet | Parallelverarbeitung Software Engineering Softwareentwicklung Lehrbuch |
url | http://deposit.dnb.de/cgi-bin/dokserv?id=393d57224d9b4e1dadecbe4c754a0803&prov=M&dok_var=1&dok_ext=htm http://www.springer.com/ http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=030866189&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |
work_keys_str_mv | AT uelschenmichael softwareengineeringparallelersystemegrundlagenalgorithmenprogrammierung AT springerfachmedienwiesbaden softwareengineeringparallelersystemegrundlagenalgorithmenprogrammierung |