Principles of parallel programming:
Gespeichert in:
| Hauptverfasser: | , |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Boston, Mass. ; Munich [u.a.]
Pearson Addison Wesley
2009
|
| Ausgabe: | 1. ed. |
| Schlagworte: | |
| Online-Zugang: | Inhaltsverzeichnis |
| Beschreibung: | XII, 338 S. Ill., graph. Darst. |
| ISBN: | 0321487907 9780321487902 |
Internformat
MARC
| LEADER | 00000nam a2200000 c 4500 | ||
|---|---|---|---|
| 001 | BV023323996 | ||
| 003 | DE-604 | ||
| 005 | 20100412 | ||
| 007 | t | ||
| 008 | 080602s2009 ad|| |||| 00||| eng d | ||
| 010 | |a 2008000970 | ||
| 020 | |a 0321487907 |9 0-321-48790-7 | ||
| 020 | |a 9780321487902 |9 978-0-321-48790-2 | ||
| 035 | |a (OCoLC)1376070166 | ||
| 035 | |a (DE-599)GBV556717538 | ||
| 040 | |a DE-604 |b ger |e aacr | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-703 |a DE-473 | ||
| 050 | 0 | |a QA76.642 | |
| 082 | 0 | |a 005.2/75 |2 22 | |
| 084 | |a ST 151 |0 (DE-625)143595: |2 rvk | ||
| 100 | 1 | |a Lin, Calvin |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Principles of parallel programming |c Calvin Lin ; Lawrence Snyder |
| 246 | 1 | 3 | |a Parallel programming |
| 250 | |a 1. ed. | ||
| 264 | 1 | |a Boston, Mass. ; Munich [u.a.] |b Pearson Addison Wesley |c 2009 | |
| 300 | |a XII, 338 S. |b Ill., graph. Darst. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 650 | 0 | |a Parallel programming (Computer science) | |
| 650 | 4 | |a Programmation parallèle (Informatique) | |
| 650 | 4 | |a Parallel programming (Computer science) | |
| 650 | 0 | 7 | |a Parallelverarbeitung |0 (DE-588)4075860-6 |2 gnd |9 rswk-swf |
| 655 | 7 | |0 (DE-588)4151278-9 |a Einführung |2 gnd-content | |
| 689 | 0 | 0 | |a Parallelverarbeitung |0 (DE-588)4075860-6 |D s |
| 689 | 0 | |5 DE-604 | |
| 700 | 1 | |a Snyder, Lawrence |e Verfasser |4 aut | |
| 856 | 4 | 2 | |m HEBIS Datenaustausch Darmstadt |q application/pdf |u http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=016508042&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |3 Inhaltsverzeichnis |
Datensatz im Suchindex
| _version_ | 1805083709147185152 |
|---|---|
| adam_text |
PARALLEL PROGRAMMING PART1 FOUNDATIONS CHAPTER 1 INTRODUCTION THE POWER
AND POTENTIAL OF PARALLELISM PARALLELISM, A FAMILIAR CONCEPT PARALLELISM
IN COMPUTER PROGRAMS MULTI-CORE COMPUTERS, AN OPPORTUNITY EVEN MORE
OPPORTUNITIES TO USE PARALLEL HARDWARE PARALLEL COMPUTING VERSUS
DISTRIBUTED COMPUTING SYSTEM LEVEL PARALLELISM CONVENIENCE OF PARALLEL
ABSTRACTIONS EXAMINING SEQUENTIAL AND PARALLEL PROGRAMS PARALLELIZING
COMPILERS A PARADIGM SHIFT PARALLEL PREFIX SUM PARALLELISM USING
MULTIPLE INSTRUCTION STREAMS THE CONCEPT OF A THREAD A MULTITHREADED
SOLUTION TO COUNTING 3S THE GOALS: SCALABILITY AND PERFORMANCE
PORTABILITY SCALABILITY PERFORMANCE PORTABILITY PRINCIPLES FIRST 2 2 3 4
6 6 8 8 9 13 15 15 15 25 25 26 27 CHAPTER SUMMARY 27 HISTORICAL
PERSPECTIVE 28 EXERCISES 28 CHAPTER 2 UNDERSTANDING PARALLEL COMPUTERS
30 BALANCING MACHINE SPECIFICS WITH PORTABILITY 30 A LOOK AT SIX
PARALLEL COMPUTERS CHIP MULTIPROCESSORS SYMMETRIC MULTIPROCESSOR
ARCHITECTURES HETEROGENEOUS CHIP DESIGNS CLUSTERS SUPERCOMPUTERS
OBSERVATIONS FROM OUR SIX PARALLEL COMPUTERS 43 AN ABSTRACTION OF A
SEQUENTIAL COMPUTER 44 APPLYING THE RAM MODEL 44 EVALUATING THE RAM
MODEL 45 THE PRAM: A PARALLEL COMPUTER MODEL 46 THE CTA: A PRACTICAL
PARALLEL COMPUTER MODEL 47 THE CTA MODEL 47 COMMUNICATION LATENCY 49
PROPERTIES OF THE CTA 52 MEMORY REFERENCE MECHANISMS 53 SHARED MEMORY 53
31 31 34 36 39 40 VIII CONTENTS ONE-SIDED COMMUNICATION MESSAGE PASSING
MEMORY CONSISTENCY MODELS PROGRAMMING MODELS A CLOSER LOOK AT
COMMUNICATION APPLYING THE CTA MODEL CHAPTER SUMMARY HISTORICAL
PERSPECTIVE EXERCISES CHAPTER 3 REASONING ABOUT PERFORMANCE MOTIVATION
AND BASIC CONCEPTS PARALLELISM VERSUS PERFORMANCE THREADS AND PROCESSES
LATENCY AND THROUGHPUT SOURCES OF PERFORMANCE LOSS OVERHEAD
NON-PARALLELIZABLE CODE CONTENTION IDLE TIME PARALLEL STRUCTURE
DEPENDENCES DEPENDENCES LIMIT PARALLELISM GRANULARITY LOCALITY
PERFORMANCE TRADE-OFFS COMMUNICATION VERSUS COMPUTATION MEMORY VERSUS
PARALLELISM OVERHEAD VERSUS PARALLELISM MEASURING PERFORMANCE EXECUTION
TIME SPEEDUP SUPERLINEAR SPEEDUP EFFICIENCY CONCERNS WITH SPEEDUP SCALED
SPEEDUP VERSUS FIXED-SIZE SPEEDUP SCALABLE PERFORMANCE 54 54 55 56 57 58
59 59 59 IMPLICATIONS FOR HARDWARE IMPLICATIONS FOR SOFTWARE SCALING THE
PROBLEM SIZE CHAPTER SUMMARY HISTORICAL PERSPECTIVE EXERCISES PART 9 82
83 83 84 84 85 61 61 61 62 62 64 64 65 67 67 68 68 70 72 73 73 74 75 75
77 77 78 78 79 79 81 81 SCALABLE PERFORMANCE IS DIFFICULT TO ACHIEVE 81
PARALLEL ABSTRACTIONS 87 CHAPTER 4 FIRST STEPS TOWARD PARALLEL
PROGRAMMING 88 DATA AND TASK PARALLELISM 88 DEFINITIONS 88 ILLUSTRATING
DATA AND TASK PARALLELISM 89 THE PERIL-L NOTATION 89 EXTENDING C 90
PARALLEL THREADS 90 SYNCHRONIZATION AND COORDINATION 91 MEMORY MODEL 92
SYNCHRONIZED MEMORY 94 REDUCE AND SCAN 95 THE REDUCE ABSTRACTION 96
COUNT 3S EXAMPLE 97 FORMULATING PARALLELISM 97 FIXED PARALLELISM 97
UNLIMITED PARALLELISM 98 SCALABLE PARALLELISM 99 ALPHABETIZING EXAMPLE
100 UNLIMITED PARALLELISM 101 FIXED PARALLELISM 102 SCALABLE PARALLELISM
104 COMPARING THE THREE SOLUTIONS 109 CHAPTER SUMMARY 110 HISTORICAL
PERSPECTIVE 110 EXERCISES 110 RR-.SR.: MM CONTENTS CHAPTER 5 SCALABLE
ALGORITHMIC TECHNIQUES BLOCKS OF INDEPENDENT COMPUTATION SCHWARTZ'
ALGORITHM THE REDUCE AND SCAN ABSTRACTIONS EXAMPLE OF GENERALIZED
REDUCES THE BASIC STRUCTURE STRUCTURE FOR GENERALIZED REDUCE EXAMPLE OF
COMPONENTS OF A GENERALIZED SCAN APPLYING THE GENERALIZED SCAN
GENERALIZED VECTOR OPERATIONS ASSIGNING WORK TO PROCESSES STATICALLY
BLOCK ALLOCATIONS OVERLAP REGIONS CYCLIC AND BLOCK CYCLIC ALLOCATIONS
IRREGULAR ALLOCATIONS ASSIGNING WORK TO PROCESSES DYNAMICALLY WORK
QUEUES VARIATIONS OF WORK QUEUES CASE STUDY: CONCURRENT MEMORY
ALLOCATION TREES ALLOCATION BY SUB-TREE DYNAMIC ALLOCATIONS CHAPTER
SUMMARY HISTORICAL PERSPECTIVE EXERCISES 112 112 113 115 116 118 119 122
124 125 125 126 128 129 132 134 134 137 137 139 139 140 141 142 142
MUTUAL EXCLUSION SYNCHRONIZATION SAFETY ISSUES PERFORMANCE ISSUES CASE
STUDY: SUCCESSIVE OVER-RELAXATION CASE STUDY. OVERLAPPING
SYNCHRONIZATION WITH COMPUTATION CASE STUDY: STREAMING COMPUTATIONS ON A
MULTI-CORE CHIP JAVA THREADS SYNCHRONIZED METHODS SYNCHRONIZED
STATEMENTS THE COUNT 3S EXAMPLE VOLATILE MEMORY ATOMIC OBJECTS LOCK
OBJECTS EXECUTORS CONCURRENT COLLECTIONS OPENMP THE COUNT 3S EXAMPLE
SEMANTIC LIMITATIONS ON PARALLEL FOR REDUCTION THREAD BEHAVIOR AND
INTERACTION SECTIONS SUMMARY OF OPENMP CHAPTER SUMMARY HISTORICAL
PERSPECTIVE EXERCISES CHAPTER 7 MPI AND OTHER LOCAL VIEW LANGUAGES 150
153 163 167 174 179 187 187 189 189 190 192 192 193 193 193 193 194 195
196 197 199 199 200 200 200 202 PART 3 PARALLEL PROGRAMMING LANGUAGES
143 CHAPTER 6 PROGRAMMING WITH THREADS 145 POSIX THREADS 145 THREAD
CREATION AND DESTRUCTION 146 MPI: THE MESSAGE PASSING INTERFACE 202 THE
COUNT 3S EXAMPLE 203 GROUPS AND COMMUNICATORS 211 POINT-TO-POINT
COMMUNICATION 212 COLLECTIVE COMMUNICATION 214 EXAMPLE: SUCCESSIVE
OVER-RELAXATION 219 PERFORMANCE ISSUES 222 SAFETY ISSUES 228 PARTITIONED
GLOBAL ADDRESS SPACE LANGUAGES 229 CONTENTS CO-ARRAY FORTRAN UNIFIED
PARALLEL C TITANIUM CHAPTER SUMMARY HISTORICAL PERSPECTIVE EXERCISES
CHAPTER 8 ZPL AND OTHER GLOBAL VIEW LANGUAGES THE ZPL PROGRAMMING
LANGUAGE BASIC CONCEPTS OF ZPL REGIONS ARRAY COMPUTATION LIFE, AN
EXAMPLE THE PROBLEM THE SOLUTION HOW IT WORKS THE PHILOSOPHY OF LIFE
DISTINGUISHING FEATURES OF ZPL REGIONS STATEMENT-LEVEL INDEXING
RESTRICTIONS IMPOSED BY REGIONS PERFORMANCE MODEL ADDITION BY
SUBTRACTION MANIPULATING ARRAYS OF DIFFERENT RANKS PARTIAL REDUCE
FLOODING THE FLOODING PRINCIPLE DATA MANIPULATION, AN EXAMPLE FLOOD
REGIONS MATRIX MULTIPLICATION REORDERING DATA WITH REMAP INDEX ARRAYS
REMAP ORDERING EXAMPLE PARALLEL EXECUTION OF ZPL PROGRAMS ROLE OF THE
COMPILER SPECIFYING THE NUMBER OF PROCESSES 230 231 232 233 234 234 236
236 237 237 240 242 242 242 243 245 245 245 245 246 246 247 247 248 249
250 251 252 253 255 255 256 258 260 260 261 ASSIGNING REGIONS TO
PROCESSES ARRAY ALLOCATION SCALAR ALLOCATION WORK ASSIGNMENT PERFORMANCE
MODEL APPLYING THE PERFORMANCE MODEL: LIFE APPLYING THE PERFORMANCE
MODEL: SUMMA SUMMARY OF THE PERFORMANCE MODEL NESL PARALLEL LANGUAGE
LANGUAGE CONCEPTS MATRIX PRODUCT USING NESTED PARALLELISM NESL
COMPLEXITY MODEL CHAPTER SUMMARY HISTORICAL PERSPECTIVE EXERCISES
CHAPTER 9 ASSESSING THE STATE OF THE ART FOUR IMPORTANT PROPERTIES OF
PARALLEL LANGUAGES CORRECTNESS PERFORMANCE SCALABILITY PORTABILITY
EVALUATING EXISTING APPROACHES POSIX THREADS JAVA THREADS OPENMP MPI
PGAS LANGUAGES ZPL NESL LESSONS FOR THE FUTURE HIDDEN PARALLELISM
TRANSPARENT PERFORMANCE LOCALITY CONSTRAINED PARALLELISM IMPLICIT VERSUS
EXPLICIT PARALLELISM CHAPTER SUMMARY HISTORICAL PERSPECTIVE EXERCISES
261 262 263 263 264 265 266 266 267 267 268 269 269 269 270 271 271 271
273 274 71A IDL RR 275 275 276 276 276 277 278 278 279 279 280 280 280
281 282 282 282 CONTENTS PART 4 LOOKING FORWARD CHAPTER 10 FUTURE
DIRECTIONS IN PARALLEL PROGRAMMING ATTACHED PROCESSORS GRAPHICS
PROCESSING UNITS CELL PROCESSORS ATTACHED PROCESSORS SUMMARY GRID
COMPUTING TRANSACTIONAL MEMORY COMPARISON WITH LOCKS IMPLEMENTATION
ISSUES OPEN RESEARCH ISSUES MAPREDUCE PROBLEM SPACE PROMOTION EMERGING
LANGUAGES CHAPEL FORTRESS X10 CHAPTER SUMMARY HISTORICAL PERSPECTIVE
EXERCISES CHAPTER 11 WRITING PARALLEL PROGRAMS GETTING STARTED ACCESS
AND SOFTWARE HELLO, WORLD 283 284 284 285 288 288 290 291 292 . 293 295
298 299 300 300 302 304 304 304 PARALLEL PROGRAMMING RECOMMENDATIONS 307
INCREMENTAL DEVELOPMENT 307 FOCUS ON THE PARALLEL STRUCTURE 307 TESTING
THE PARALLEL STRUCTURE 308 SEQUENTIAL PROGRAMMING 309 BE WILLING TO
WRITE EXTRA CODE 309 CONTROLLING PARAMETERS DURING TESTING 310
FUNCTIONAL DEBUGGING 310 CAPSTONE PROJECT IDEAS 311 IMPLEMENTING
EXISTING PARALLEL ALGORITHMS 311 COMPETING WITH STANDARD BENCHMARKS 312
DEVELOPING NEW PARALLEL COMPUTATIONS 313 PERFORMANCE MEASUREMENT 314
COMPARING AGAINST A SEQUENTIAL SOLUTION 315 MAINTAINING A FAIR
EXPERIMENTAL SETTING 315 296 UNDERSTANDING PARALLEL PERFORMANCE 316
PERFORMANCE ANALYSIS EXPERIMENTAL METHODOLOGY PORTABILITY AND TUNING
CHAPTER SUMMARY HISTORICAL PERSPECTIVE EXERCISES 305 GLOSSARY 305
REFERENCES 305 306 INDEX 317 318 319 319 319 320 321 325 328 |
| adam_txt |
PARALLEL PROGRAMMING PART1 FOUNDATIONS CHAPTER 1 INTRODUCTION THE POWER
AND POTENTIAL OF PARALLELISM PARALLELISM, A FAMILIAR CONCEPT PARALLELISM
IN COMPUTER PROGRAMS MULTI-CORE COMPUTERS, AN OPPORTUNITY EVEN MORE
OPPORTUNITIES TO USE PARALLEL HARDWARE PARALLEL COMPUTING VERSUS
DISTRIBUTED COMPUTING SYSTEM LEVEL PARALLELISM CONVENIENCE OF PARALLEL
ABSTRACTIONS EXAMINING SEQUENTIAL AND PARALLEL PROGRAMS PARALLELIZING
COMPILERS A PARADIGM SHIFT PARALLEL PREFIX SUM PARALLELISM USING
MULTIPLE INSTRUCTION STREAMS THE CONCEPT OF A THREAD A MULTITHREADED
SOLUTION TO COUNTING 3S THE GOALS: SCALABILITY AND PERFORMANCE
PORTABILITY SCALABILITY PERFORMANCE PORTABILITY PRINCIPLES FIRST 2 2 3 4
6 6 8 8 9 13 15 15 15 25 25 26 27 CHAPTER SUMMARY 27 HISTORICAL
PERSPECTIVE 28 EXERCISES 28 CHAPTER 2 UNDERSTANDING PARALLEL COMPUTERS
30 BALANCING MACHINE SPECIFICS WITH PORTABILITY 30 A LOOK AT SIX
PARALLEL COMPUTERS CHIP MULTIPROCESSORS SYMMETRIC MULTIPROCESSOR
ARCHITECTURES HETEROGENEOUS CHIP DESIGNS CLUSTERS SUPERCOMPUTERS
OBSERVATIONS FROM OUR SIX PARALLEL COMPUTERS 43 AN ABSTRACTION OF A
SEQUENTIAL COMPUTER 44 APPLYING THE RAM MODEL 44 EVALUATING THE RAM
MODEL 45 THE PRAM: A PARALLEL COMPUTER MODEL 46 THE CTA: A PRACTICAL
PARALLEL COMPUTER MODEL 47 THE CTA MODEL 47 COMMUNICATION LATENCY 49
PROPERTIES OF THE CTA 52 MEMORY REFERENCE MECHANISMS 53 SHARED MEMORY 53
31 31 34 36 39 40 VIII CONTENTS ONE-SIDED COMMUNICATION MESSAGE PASSING
MEMORY CONSISTENCY MODELS PROGRAMMING MODELS A CLOSER LOOK AT
COMMUNICATION APPLYING THE CTA MODEL CHAPTER SUMMARY HISTORICAL
PERSPECTIVE EXERCISES CHAPTER 3 REASONING ABOUT PERFORMANCE MOTIVATION
AND BASIC CONCEPTS PARALLELISM VERSUS PERFORMANCE THREADS AND PROCESSES
LATENCY AND THROUGHPUT SOURCES OF PERFORMANCE LOSS OVERHEAD
NON-PARALLELIZABLE CODE CONTENTION IDLE TIME PARALLEL STRUCTURE
DEPENDENCES DEPENDENCES LIMIT PARALLELISM GRANULARITY LOCALITY
PERFORMANCE TRADE-OFFS COMMUNICATION VERSUS COMPUTATION MEMORY VERSUS
PARALLELISM OVERHEAD VERSUS PARALLELISM MEASURING PERFORMANCE EXECUTION
TIME SPEEDUP SUPERLINEAR SPEEDUP EFFICIENCY CONCERNS WITH SPEEDUP SCALED
SPEEDUP VERSUS FIXED-SIZE SPEEDUP SCALABLE PERFORMANCE 54 54 55 56 57 58
59 59 59 IMPLICATIONS FOR HARDWARE IMPLICATIONS FOR SOFTWARE SCALING THE
PROBLEM SIZE CHAPTER SUMMARY HISTORICAL PERSPECTIVE EXERCISES PART 9 82
83 83 84 84 85 61 61 61 62 62 64 64 65 67 67 68 68 70 72 73 73 74 75 75
77 77 78 78 79 79 81 81 SCALABLE PERFORMANCE IS DIFFICULT TO ACHIEVE 81
PARALLEL ABSTRACTIONS 87 CHAPTER 4 FIRST STEPS TOWARD PARALLEL
PROGRAMMING 88 DATA AND TASK PARALLELISM 88 DEFINITIONS 88 ILLUSTRATING
DATA AND TASK PARALLELISM 89 THE PERIL-L NOTATION 89 EXTENDING C 90
PARALLEL THREADS 90 SYNCHRONIZATION AND COORDINATION 91 MEMORY MODEL 92
SYNCHRONIZED MEMORY 94 REDUCE AND SCAN 95 THE REDUCE ABSTRACTION 96
COUNT 3S EXAMPLE 97 FORMULATING PARALLELISM 97 FIXED PARALLELISM 97
UNLIMITED PARALLELISM 98 SCALABLE PARALLELISM 99 ALPHABETIZING EXAMPLE
100 UNLIMITED PARALLELISM 101 FIXED PARALLELISM 102 SCALABLE PARALLELISM
104 COMPARING THE THREE SOLUTIONS 109 CHAPTER SUMMARY 110 HISTORICAL
PERSPECTIVE 110 EXERCISES 110 RR-.SR.: MM CONTENTS CHAPTER 5 SCALABLE
ALGORITHMIC TECHNIQUES BLOCKS OF INDEPENDENT COMPUTATION SCHWARTZ'
ALGORITHM THE REDUCE AND SCAN ABSTRACTIONS EXAMPLE OF GENERALIZED
REDUCES THE BASIC STRUCTURE STRUCTURE FOR GENERALIZED REDUCE EXAMPLE OF
COMPONENTS OF A GENERALIZED SCAN APPLYING THE GENERALIZED SCAN
GENERALIZED VECTOR OPERATIONS ASSIGNING WORK TO PROCESSES STATICALLY
BLOCK ALLOCATIONS OVERLAP REGIONS CYCLIC AND BLOCK CYCLIC ALLOCATIONS
IRREGULAR ALLOCATIONS ASSIGNING WORK TO PROCESSES DYNAMICALLY WORK
QUEUES VARIATIONS OF WORK QUEUES CASE STUDY: CONCURRENT MEMORY
ALLOCATION TREES ALLOCATION BY SUB-TREE DYNAMIC ALLOCATIONS CHAPTER
SUMMARY HISTORICAL PERSPECTIVE EXERCISES 112 112 113 115 116 118 119 122
124 125 125 126 128 129 132 134 134 137 137 139 139 140 141 142 142
MUTUAL EXCLUSION SYNCHRONIZATION SAFETY ISSUES PERFORMANCE ISSUES CASE
STUDY: SUCCESSIVE OVER-RELAXATION CASE STUDY. OVERLAPPING
SYNCHRONIZATION WITH COMPUTATION CASE STUDY: STREAMING COMPUTATIONS ON A
MULTI-CORE CHIP JAVA THREADS SYNCHRONIZED METHODS SYNCHRONIZED
STATEMENTS THE COUNT 3S EXAMPLE VOLATILE MEMORY ATOMIC OBJECTS LOCK
OBJECTS EXECUTORS CONCURRENT COLLECTIONS OPENMP THE COUNT 3S EXAMPLE
SEMANTIC LIMITATIONS ON PARALLEL FOR REDUCTION THREAD BEHAVIOR AND
INTERACTION SECTIONS SUMMARY OF OPENMP CHAPTER SUMMARY HISTORICAL
PERSPECTIVE EXERCISES CHAPTER 7 MPI AND OTHER LOCAL VIEW LANGUAGES 150
153 163 167 174 179 187 187 189 189 190 192 192 193 193 193 193 194 195
196 197 199 199 200 200 200 202 PART 3 PARALLEL PROGRAMMING LANGUAGES
143 CHAPTER 6 PROGRAMMING WITH THREADS 145 POSIX THREADS 145 THREAD
CREATION AND DESTRUCTION 146 MPI: THE MESSAGE PASSING INTERFACE 202 THE
COUNT 3S EXAMPLE 203 GROUPS AND COMMUNICATORS 211 POINT-TO-POINT
COMMUNICATION 212 COLLECTIVE COMMUNICATION 214 EXAMPLE: SUCCESSIVE
OVER-RELAXATION 219 PERFORMANCE ISSUES 222 SAFETY ISSUES 228 PARTITIONED
GLOBAL ADDRESS SPACE LANGUAGES 229 CONTENTS CO-ARRAY FORTRAN UNIFIED
PARALLEL C TITANIUM CHAPTER SUMMARY HISTORICAL PERSPECTIVE EXERCISES
CHAPTER 8 ZPL AND OTHER GLOBAL VIEW LANGUAGES THE ZPL PROGRAMMING
LANGUAGE BASIC CONCEPTS OF ZPL REGIONS ARRAY COMPUTATION LIFE, AN
EXAMPLE THE PROBLEM THE SOLUTION HOW IT WORKS THE PHILOSOPHY OF LIFE
DISTINGUISHING FEATURES OF ZPL REGIONS STATEMENT-LEVEL INDEXING
RESTRICTIONS IMPOSED BY REGIONS PERFORMANCE MODEL ADDITION BY
SUBTRACTION MANIPULATING ARRAYS OF DIFFERENT RANKS PARTIAL REDUCE
FLOODING THE FLOODING PRINCIPLE DATA MANIPULATION, AN EXAMPLE FLOOD
REGIONS MATRIX MULTIPLICATION REORDERING DATA WITH REMAP INDEX ARRAYS
REMAP ORDERING EXAMPLE PARALLEL EXECUTION OF ZPL PROGRAMS ROLE OF THE
COMPILER SPECIFYING THE NUMBER OF PROCESSES 230 231 232 233 234 234 236
236 237 237 240 242 242 242 243 245 245 245 245 246 246 247 247 248 249
250 251 252 253 255 255 256 258 260 260 261 ASSIGNING REGIONS TO
PROCESSES ARRAY ALLOCATION SCALAR ALLOCATION WORK ASSIGNMENT PERFORMANCE
MODEL APPLYING THE PERFORMANCE MODEL: LIFE APPLYING THE PERFORMANCE
MODEL: SUMMA SUMMARY OF THE PERFORMANCE MODEL NESL PARALLEL LANGUAGE
LANGUAGE CONCEPTS MATRIX PRODUCT USING NESTED PARALLELISM NESL
COMPLEXITY MODEL CHAPTER SUMMARY HISTORICAL PERSPECTIVE EXERCISES
CHAPTER 9 ASSESSING THE STATE OF THE ART FOUR IMPORTANT PROPERTIES OF
PARALLEL LANGUAGES CORRECTNESS PERFORMANCE SCALABILITY PORTABILITY
EVALUATING EXISTING APPROACHES POSIX THREADS JAVA THREADS OPENMP MPI
PGAS LANGUAGES ZPL NESL LESSONS FOR THE FUTURE HIDDEN PARALLELISM
TRANSPARENT PERFORMANCE LOCALITY CONSTRAINED PARALLELISM IMPLICIT VERSUS
EXPLICIT PARALLELISM CHAPTER SUMMARY HISTORICAL PERSPECTIVE EXERCISES
261 262 263 263 264 265 266 266 267 267 268 269 269 269 270 271 271 271
273 274 71A IDL RR 275 275 276 276 276 277 278 278 279 279 280 280 280
281 282 282 282 CONTENTS PART 4 LOOKING FORWARD CHAPTER 10 FUTURE
DIRECTIONS IN PARALLEL PROGRAMMING ATTACHED PROCESSORS GRAPHICS
PROCESSING UNITS CELL PROCESSORS ATTACHED PROCESSORS SUMMARY GRID
COMPUTING TRANSACTIONAL MEMORY COMPARISON WITH LOCKS IMPLEMENTATION
ISSUES OPEN RESEARCH ISSUES MAPREDUCE PROBLEM SPACE PROMOTION EMERGING
LANGUAGES CHAPEL FORTRESS X10 CHAPTER SUMMARY HISTORICAL PERSPECTIVE
EXERCISES CHAPTER 11 WRITING PARALLEL PROGRAMS GETTING STARTED ACCESS
AND SOFTWARE HELLO, WORLD 283 284 284 285 288 288 290 291 292 . 293 295
298 299 300 300 302 304 304 304 PARALLEL PROGRAMMING RECOMMENDATIONS 307
INCREMENTAL DEVELOPMENT 307 FOCUS ON THE PARALLEL STRUCTURE 307 TESTING
THE PARALLEL STRUCTURE 308 SEQUENTIAL PROGRAMMING 309 BE WILLING TO
WRITE EXTRA CODE 309 CONTROLLING PARAMETERS DURING TESTING 310
FUNCTIONAL DEBUGGING 310 CAPSTONE PROJECT IDEAS 311 IMPLEMENTING
EXISTING PARALLEL ALGORITHMS 311 COMPETING WITH STANDARD BENCHMARKS 312
DEVELOPING NEW PARALLEL COMPUTATIONS 313 PERFORMANCE MEASUREMENT 314
COMPARING AGAINST A SEQUENTIAL SOLUTION 315 MAINTAINING A FAIR
EXPERIMENTAL SETTING 315 296 UNDERSTANDING PARALLEL PERFORMANCE 316
PERFORMANCE ANALYSIS EXPERIMENTAL METHODOLOGY PORTABILITY AND TUNING
CHAPTER SUMMARY HISTORICAL PERSPECTIVE EXERCISES 305 GLOSSARY 305
REFERENCES 305 306 INDEX 317 318 319 319 319 320 321 325 328 |
| any_adam_object | 1 |
| any_adam_object_boolean | 1 |
| author | Lin, Calvin Snyder, Lawrence |
| author_facet | Lin, Calvin Snyder, Lawrence |
| author_role | aut aut |
| author_sort | Lin, Calvin |
| author_variant | c l cl l s ls |
| building | Verbundindex |
| bvnumber | BV023323996 |
| callnumber-first | Q - Science |
| callnumber-label | QA76 |
| callnumber-raw | QA76.642 |
| callnumber-search | QA76.642 |
| callnumber-sort | QA 276.642 |
| callnumber-subject | QA - Mathematics |
| classification_rvk | ST 151 |
| ctrlnum | (OCoLC)1376070166 (DE-599)GBV556717538 |
| dewey-full | 005.2/75 |
| dewey-hundreds | 000 - Computer science, information, general works |
| dewey-ones | 005 - Computer programming, programs, data, security |
| dewey-raw | 005.2/75 |
| dewey-search | 005.2/75 |
| dewey-sort | 15.2 275 |
| dewey-tens | 000 - Computer science, information, general works |
| discipline | Informatik |
| discipline_str_mv | Informatik |
| edition | 1. ed. |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>00000nam a2200000 c 4500</leader><controlfield tag="001">BV023323996</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20100412</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">080602s2009 ad|| |||| 00||| eng d</controlfield><datafield tag="010" ind1=" " ind2=" "><subfield code="a">2008000970</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">0321487907</subfield><subfield code="9">0-321-48790-7</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9780321487902</subfield><subfield code="9">978-0-321-48790-2</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)1376070166</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)GBV556717538</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">aacr</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-703</subfield><subfield code="a">DE-473</subfield></datafield><datafield tag="050" ind1=" " ind2="0"><subfield code="a">QA76.642</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">005.2/75</subfield><subfield code="2">22</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="100" ind1="1" ind2=" "><subfield code="a">Lin, Calvin</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Principles of parallel programming</subfield><subfield code="c">Calvin Lin ; Lawrence Snyder</subfield></datafield><datafield tag="246" ind1="1" ind2="3"><subfield code="a">Parallel programming</subfield></datafield><datafield tag="250" ind1=" " ind2=" "><subfield code="a">1. ed.</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Boston, Mass. ; Munich [u.a.]</subfield><subfield code="b">Pearson Addison Wesley</subfield><subfield code="c">2009</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">XII, 338 S.</subfield><subfield code="b">Ill., graph. Darst.</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="650" ind1=" " ind2="0"><subfield code="a">Parallel programming (Computer science)</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Programmation parallèle (Informatique)</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Parallel programming (Computer science)</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="655" ind1=" " ind2="7"><subfield code="0">(DE-588)4151278-9</subfield><subfield code="a">Einführung</subfield><subfield code="2">gnd-content</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=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Snyder, Lawrence</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="m">HEBIS Datenaustausch Darmstadt</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=016508042&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA</subfield><subfield code="3">Inhaltsverzeichnis</subfield></datafield></record></collection> |
| genre | (DE-588)4151278-9 Einführung gnd-content |
| genre_facet | Einführung |
| id | DE-604.BV023323996 |
| illustrated | Illustrated |
| index_date | 2024-07-02T20:54:48Z |
| indexdate | 2024-07-20T07:52:51Z |
| institution | BVB |
| isbn | 0321487907 9780321487902 |
| language | English |
| lccn | 2008000970 |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-016508042 |
| oclc_num | 1376070166 |
| open_access_boolean | |
| owner | DE-703 DE-473 DE-BY-UBG |
| owner_facet | DE-703 DE-473 DE-BY-UBG |
| physical | XII, 338 S. Ill., graph. Darst. |
| publishDate | 2009 |
| publishDateSearch | 2009 |
| publishDateSort | 2009 |
| publisher | Pearson Addison Wesley |
| record_format | marc |
| spelling | Lin, Calvin Verfasser aut Principles of parallel programming Calvin Lin ; Lawrence Snyder Parallel programming 1. ed. Boston, Mass. ; Munich [u.a.] Pearson Addison Wesley 2009 XII, 338 S. Ill., graph. Darst. txt rdacontent n rdamedia nc rdacarrier Parallel programming (Computer science) Programmation parallèle (Informatique) Parallelverarbeitung (DE-588)4075860-6 gnd rswk-swf (DE-588)4151278-9 Einführung gnd-content Parallelverarbeitung (DE-588)4075860-6 s DE-604 Snyder, Lawrence Verfasser aut HEBIS Datenaustausch Darmstadt application/pdf http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=016508042&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA Inhaltsverzeichnis |
| spellingShingle | Lin, Calvin Snyder, Lawrence Principles of parallel programming Parallel programming (Computer science) Programmation parallèle (Informatique) Parallelverarbeitung (DE-588)4075860-6 gnd |
| subject_GND | (DE-588)4075860-6 (DE-588)4151278-9 |
| title | Principles of parallel programming |
| title_alt | Parallel programming |
| title_auth | Principles of parallel programming |
| title_exact_search | Principles of parallel programming |
| title_exact_search_txtP | Principles of parallel programming |
| title_full | Principles of parallel programming Calvin Lin ; Lawrence Snyder |
| title_fullStr | Principles of parallel programming Calvin Lin ; Lawrence Snyder |
| title_full_unstemmed | Principles of parallel programming Calvin Lin ; Lawrence Snyder |
| title_short | Principles of parallel programming |
| title_sort | principles of parallel programming |
| topic | Parallel programming (Computer science) Programmation parallèle (Informatique) Parallelverarbeitung (DE-588)4075860-6 gnd |
| topic_facet | Parallel programming (Computer science) Programmation parallèle (Informatique) Parallelverarbeitung Einführung |
| url | http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=016508042&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |
| work_keys_str_mv | AT lincalvin principlesofparallelprogramming AT snyderlawrence principlesofparallelprogramming AT lincalvin parallelprogramming AT snyderlawrence parallelprogramming |