Introduction to parallel computing:
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Cambridge
Cambridge University Press
2016
|
| Schlagworte: | |
| Online-Zugang: | Autorenbiografie Verlagsangaben Inhaltsverzeichnis Inhaltsverzeichnis |
| Beschreibung: | Literaturverzeichnis: Seite 323-342 |
| Beschreibung: | xxvii, 354 Seiten Illustrationen, Diagramme |
| ISBN: | 9781107174399 |
Internformat
MARC
| LEADER | 00000nam a2200000 c 4500 | ||
|---|---|---|---|
| 001 | BV044242229 | ||
| 003 | DE-604 | ||
| 005 | 20220705 | ||
| 007 | t | ||
| 008 | 170327s2016 a||| |||| 00||| eng d | ||
| 020 | |a 9781107174399 |c hardback : alk. paper |9 978-1-107-17439-9 | ||
| 035 | |a (OCoLC)983779269 | ||
| 035 | |a (DE-599)GBV874794803 | ||
| 040 | |a DE-604 |b ger |e rda | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-20 |a DE-739 |a DE-83 | ||
| 050 | 0 | |a QA76.58 | |
| 084 | |a ST 130 |0 (DE-625)143588: |2 rvk | ||
| 084 | |a ST 150 |0 (DE-625)143594: |2 rvk | ||
| 084 | |a ST 151 |0 (DE-625)143595: |2 rvk | ||
| 084 | |a ST 230 |0 (DE-625)143617: |2 rvk | ||
| 100 | 1 | |a Czech, Zbigniew J. |d 1948- |e Verfasser |0 (DE-588)1130186733 |4 aut | |
| 245 | 1 | 0 | |a Introduction to parallel computing |c Zbigniew J. Czech, Silesian University of Technology |
| 264 | 1 | |a Cambridge |b Cambridge University Press |c 2016 | |
| 300 | |a xxvii, 354 Seiten |b Illustrationen, Diagramme | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 500 | |a Literaturverzeichnis: Seite 323-342 | ||
| 650 | 0 | 7 | |a Paralleler Algorithmus |0 (DE-588)4193615-2 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Programmierung |0 (DE-588)4076370-5 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Parallelverarbeitung |0 (DE-588)4075860-6 |2 gnd |9 rswk-swf |
| 689 | 0 | 0 | |a Parallelverarbeitung |0 (DE-588)4075860-6 |D s |
| 689 | 0 | 1 | |a Programmierung |0 (DE-588)4076370-5 |D s |
| 689 | 0 | 2 | |a Paralleler Algorithmus |0 (DE-588)4193615-2 |D s |
| 689 | 0 | |5 DE-604 | |
| 856 | 4 | 2 | |u https://www.loc.gov/catdir/enhancements/fy1618/2016042341-b.html |3 Autorenbiografie |
| 856 | 4 | 2 | |u https://www.loc.gov/catdir/enhancements/fy1618/2016042341-d.html |3 Verlagsangaben |
| 856 | 4 | 2 | |u https://www.loc.gov/catdir/enhancements/fy1618/2016042341-t.html |3 Inhaltsverzeichnis |
| 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=029647554&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |3 Inhaltsverzeichnis |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-029647554 | ||
Datensatz im Suchindex
| _version_ | 1804177404369829888 |
|---|---|
| adam_text | Contents
List of Figures
List of Tables xix
Preface xxi
1 Concurrent Processes 1
1.1 Basic Concepts 1
1.1.1 Communication between Processes 2
1.1.2 Concurrent, Parallel, and Distributed Program 3
1.2 Concurrency of Processes in Operating Systems 4
1.2.1 Threads 5
1.3 Correctness of Concurrent Programs 6
1.4 Selected Problems in Concurrent Programming 8
1.4.1 The Critical Section Problem ՝ 8
1.4.2 The Producer and Consumer Problem 11
1.4.3 The Dining Philosophers Problem 14
1.4.4 The Readers and Writers Problem 17
1.4.5 Monitors 18
1.5 Notes to the Chapter 24
1.6 Exercises 25
1.7 Bibliographic Notes 34
2 Basic Models of Parallel Computation 35
2.1 The Shared Memory Model 35
2.1.1 The RAM Model 35
2.1.2 The PRAM Model 39
2.2 The Network Model 41
2.2.1 Mesh 43
2.2.2 Mesh of trees 43
2.2.3 Cube 44
2.2.4 Cube Connected Cycles 45
2.2.5 Butterfly 46
2.3 Comparison of Parallel Computation Models 47
2.4 Notes to the Chapter 56
2.5 Exercises 58
2.6 Bibliographic Notes 61
3 Elementary Parallel Algorithms 63
3.1 Evaluation of Parallel Algorithms 63
3.1.1 Scalable Parallel Systems 67
3.1.2 Isoefficiency Function 68
3.2 Amdahl’s Law 69
3.3 Gustafson-Barsis’s Law 70
3.4 Karp-Flatt Metric 71
3.5 Algorithms for the Shared Memory Model 72
3.5.1 Finding the Minimum and Sum of Elements in
O(log n)Time 73
3.5.2 Brent’s Theorem 77
3.5.3 Prefix Computation 80
3.5.4 Finding the Minimum in 9(1 ) Time 81
3.5.5 Sorting in 9(log«) Time 83
3.5.6 Matrix-Matrix Multiplication 84
3.5.7 Computations on Lists 87
3.5.8 The Euler Cycle Method 88
3.6 Algorithms for the Network Model 92
3.6.1 Matrix-Vector Multiplication in a One-dimensional
Torus Network 92
3.6.2 Matrix-Matrix Multiplication in a Two-dimensional
Torus Network 94
3.6.3 Reduction Operation in a Cube Network 96
3.6.4 Broadcast in a Cube Network 97
3.6.5 Prefix Computation in a Cube Network 98
3.7 Classes of Problems Solved in Parallel 100
3.8 Notes to the Chapter 103
3.8.1 Cole’s Parallel Sorting Algorithm 103
3.8.2 Bitonic Sort—Batcher’s Network 112
3.8.3 The Parallel Computation Thesis 117
3.9 Exercises 118
3.10 Bibliographic Notes 123
4 Designing Parallel Algorithms 125
4.1 Steps of Designing 125
4.2 Problem Decomposition 125
4.2.1 Types of Decomposition 125
4.2.2 Functional Decomposition 130
4.2.3 Data Decomposition 131
4.2.4 Recursive Decomposition 133
4.2.5 Exploratory Decomposition 135
4.2.6 Speculative Decomposition 136
4.3 Granularity of Computation 137
4.4 Minimizing Cost of Parallel Algorithm 139
4.4.1 The Parallel Overhead 139
4.4.2 Redundant Computations 140
4.4.3 Processor Idling 140
4.4.4 References to Common Data 141
4.4.5 Overlapping Communication and Computation 142
4.5 Assigning Tasks to Processors 143
4.5.1 Load Balancing 143
4.5.2 Static Load Balancing 145
4.5.3 Dynamic Load Balancing 151
4.6 Notes to the Chapter 156
4.6.1 Foster’s Method 156
4.6.2 Partitioning 158
4.6.3 Communication 158
4.6.4 Agglomeration 159
4.6.5 Mapping 160
4.7 Exercises 161
4.8 Bibliographic Notes 173
5 Architectures of Parallel Computers 175
5.1 Classification of Architectures 175
5.1.1 Multicore Processors 178
5.2 Processor Arrays 180
5.3 Multiprocessor Computers 181
5.3.1 Shared-memory Multiprocessors 182
5.3.2 Distributed-memory Multiprocessors 183
5.3.3 Distributed Shared Memory 183
5.4 Clusters 184
5.4.1 Symmetric Multiprocessor Clusters 184
5.4.2 Multicore Processor Clusters 185
5.4.3 Computer Clusters 185
5.4.4 Features and Use of Clusters 187
5.5 Computers of Unconventional Architectures 189
5.5.1 Dataflow Computers 189
5.5.2 Systolic Computers 196
5.6 Interconnection Networks 198
5.6.1 Characteristics of Interconnection Networks 198
5.6.2 Network Topologies 199
5.7 Notes to the Chapter 206
5.8 Exercises 209
5.9 Bibliographic Notes 212
6 Message-passing Programming 214
6.1 Introduction 214
6.2 The MPI Model of Computation 215
6.3 Minimum Graph Bisection 216
6.3.1 Program Compilation and Execution 218
6.3.2 Functions MPI_Init and MPI_Finalize 219
6.3.3 Functions MPI_Comm_rank and MPI_Comm_size 220
6.3.4 Functions MPI_Send and MPI_Recv 220
6.3.5 Collective Communication---Functions MPI_Bcast and
MPI_Reduce 224
6.4 Sorting 228
6.4.1 Creating New Communicators---Function
MPI_Comm_split 228
6.4.2 Collecting and Spreading Data---Functions MPI_Gather
and MPI_Scatter 230
6.5 Finding Prime Numbers 232
6.5.1 Function MPI_Gatherv 234
6.5.2 Function MPI_Wtime 235
6.6 Matrix-Vector Multiplication 236
6.7 Exercises 240
6.8 Bibliographic Notes 241
Shared-memory Programming 243
7.1 Introduction 243
7.2 The OpenMP Model of Computation 244
7.3 Creating a Parallel Program 246
7.4 Basic Constructs 249
74.1 The Construct and Region Concepts 249
7.4.2 Parallel Construct 250
7.4.3 Program Compilation and Execution 252
7.4.4 Loop Construct 252
7.4.5 Sections Construct 255
7.4.6 Single Construct 257
7.4.7 Task Construct 258
7.4.8 Taskyield Construct 259
7.5 Clauses 259
7.5.1 The Purpose of Clauses 259
7.5.2 Shared Clause 260
7.5.3 Private Clause 260
7.5.4 Firstprivate Clause 260
7.5.5 Lastprivate Clause 261
7.5.6 Default Clause 261
7.5.7 Nowait Clause 262
7.5.8 Schedule Clause 262
7.5.9 Reduction Clause 264
7.5.10 If Clause 266
7.5.11 Num_threads Clause 267
7.5.12 Copyin Clause 268
7.5.13 Copyprivate Clause 268
7.6 Master and Synchronization Constructs 269
7.6.1 Master Construct 269
7.6.2 Barrier Construct 270
7.6.3 Taskwait Construct 270
7.6.4 Critical Construct 271
7.6.5 Ordered Construct 271
76.6 Atomic Construct 272
76.7 Flush Construct 273
7.7 Threadprivate Directive 274
78 Minimum Graph Bisection 275
79 Sorting 276
710 Finding Prime Numbers 277
711 Exercises 281
712 Bibliographic Notes 281
Solutions to Selected Exercises 283
Glossary 305
References 323
Index 343
|
| any_adam_object | 1 |
| author | Czech, Zbigniew J. 1948- |
| author_GND | (DE-588)1130186733 |
| author_facet | Czech, Zbigniew J. 1948- |
| author_role | aut |
| author_sort | Czech, Zbigniew J. 1948- |
| author_variant | z j c zj zjc |
| building | Verbundindex |
| bvnumber | BV044242229 |
| callnumber-first | Q - Science |
| callnumber-label | QA76 |
| callnumber-raw | QA76.58 |
| callnumber-search | QA76.58 |
| callnumber-sort | QA 276.58 |
| callnumber-subject | QA - Mathematics |
| classification_rvk | ST 130 ST 150 ST 151 ST 230 |
| ctrlnum | (OCoLC)983779269 (DE-599)GBV874794803 |
| discipline | Informatik |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>02083nam a2200457 c 4500</leader><controlfield tag="001">BV044242229</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20220705 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">170327s2016 a||| |||| 00||| eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781107174399</subfield><subfield code="c">hardback : alk. paper</subfield><subfield code="9">978-1-107-17439-9</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)983779269</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)GBV874794803</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">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-20</subfield><subfield code="a">DE-739</subfield><subfield code="a">DE-83</subfield></datafield><datafield tag="050" ind1=" " ind2="0"><subfield code="a">QA76.58</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">ST 130</subfield><subfield code="0">(DE-625)143588:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">ST 150</subfield><subfield code="0">(DE-625)143594:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">ST 151</subfield><subfield code="0">(DE-625)143595:</subfield><subfield code="2">rvk</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="100" ind1="1" ind2=" "><subfield code="a">Czech, Zbigniew J.</subfield><subfield code="d">1948-</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)1130186733</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Introduction to parallel computing</subfield><subfield code="c">Zbigniew J. Czech, Silesian University of Technology</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Cambridge</subfield><subfield code="b">Cambridge University Press</subfield><subfield code="c">2016</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">xxvii, 354 Seiten</subfield><subfield code="b">Illustrationen, Diagramme</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="500" ind1=" " ind2=" "><subfield code="a">Literaturverzeichnis: Seite 323-342</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Paralleler Algorithmus</subfield><subfield code="0">(DE-588)4193615-2</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Programmierung</subfield><subfield code="0">(DE-588)4076370-5</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</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="689" ind1="0" ind2="0"><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="1"><subfield code="a">Programmierung</subfield><subfield code="0">(DE-588)4076370-5</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="2"><subfield code="a">Paralleler Algorithmus</subfield><subfield code="0">(DE-588)4193615-2</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="u">https://www.loc.gov/catdir/enhancements/fy1618/2016042341-b.html</subfield><subfield code="3">Autorenbiografie</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="u">https://www.loc.gov/catdir/enhancements/fy1618/2016042341-d.html</subfield><subfield code="3">Verlagsangaben</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="u">https://www.loc.gov/catdir/enhancements/fy1618/2016042341-t.html</subfield><subfield code="3">Inhaltsverzeichnis</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=029647554&sequence=000002&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-029647554</subfield></datafield></record></collection> |
| id | DE-604.BV044242229 |
| illustrated | Illustrated |
| indexdate | 2024-07-10T07:47:32Z |
| institution | BVB |
| isbn | 9781107174399 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-029647554 |
| oclc_num | 983779269 |
| open_access_boolean | |
| owner | DE-20 DE-739 DE-83 |
| owner_facet | DE-20 DE-739 DE-83 |
| physical | xxvii, 354 Seiten Illustrationen, Diagramme |
| publishDate | 2016 |
| publishDateSearch | 2016 |
| publishDateSort | 2016 |
| publisher | Cambridge University Press |
| record_format | marc |
| spelling | Czech, Zbigniew J. 1948- Verfasser (DE-588)1130186733 aut Introduction to parallel computing Zbigniew J. Czech, Silesian University of Technology Cambridge Cambridge University Press 2016 xxvii, 354 Seiten Illustrationen, Diagramme txt rdacontent n rdamedia nc rdacarrier Literaturverzeichnis: Seite 323-342 Paralleler Algorithmus (DE-588)4193615-2 gnd rswk-swf Programmierung (DE-588)4076370-5 gnd rswk-swf Parallelverarbeitung (DE-588)4075860-6 gnd rswk-swf Parallelverarbeitung (DE-588)4075860-6 s Programmierung (DE-588)4076370-5 s Paralleler Algorithmus (DE-588)4193615-2 s DE-604 https://www.loc.gov/catdir/enhancements/fy1618/2016042341-b.html Autorenbiografie https://www.loc.gov/catdir/enhancements/fy1618/2016042341-d.html Verlagsangaben https://www.loc.gov/catdir/enhancements/fy1618/2016042341-t.html Inhaltsverzeichnis 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=029647554&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA Inhaltsverzeichnis |
| spellingShingle | Czech, Zbigniew J. 1948- Introduction to parallel computing Paralleler Algorithmus (DE-588)4193615-2 gnd Programmierung (DE-588)4076370-5 gnd Parallelverarbeitung (DE-588)4075860-6 gnd |
| subject_GND | (DE-588)4193615-2 (DE-588)4076370-5 (DE-588)4075860-6 |
| title | Introduction to parallel computing |
| title_auth | Introduction to parallel computing |
| title_exact_search | Introduction to parallel computing |
| title_full | Introduction to parallel computing Zbigniew J. Czech, Silesian University of Technology |
| title_fullStr | Introduction to parallel computing Zbigniew J. Czech, Silesian University of Technology |
| title_full_unstemmed | Introduction to parallel computing Zbigniew J. Czech, Silesian University of Technology |
| title_short | Introduction to parallel computing |
| title_sort | introduction to parallel computing |
| topic | Paralleler Algorithmus (DE-588)4193615-2 gnd Programmierung (DE-588)4076370-5 gnd Parallelverarbeitung (DE-588)4075860-6 gnd |
| topic_facet | Paralleler Algorithmus Programmierung Parallelverarbeitung |
| url | https://www.loc.gov/catdir/enhancements/fy1618/2016042341-b.html https://www.loc.gov/catdir/enhancements/fy1618/2016042341-d.html https://www.loc.gov/catdir/enhancements/fy1618/2016042341-t.html http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=029647554&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |
| work_keys_str_mv | AT czechzbigniewj introductiontoparallelcomputing |
Es ist kein Print-Exemplar vorhanden.
Inhaltsverzeichnis