Introduction to parallel computing:
Saved in:
| Format: | Book |
|---|---|
| Language: | English |
| Published: |
Harlow ; Munich [u.a.]
Addison-Wesley
2003
|
| Edition: | 2. ed. |
| Subjects: | |
| Online Access: | Inhaltsverzeichnis |
| Item Description: | 1. Aufl. u.d.T: Introduction to parallel programming / Vipin Kumar ... Hier auch später erschienene, unveränderte Nachdrucke |
| Physical Description: | XX, 636 S. graph. Darst. |
| ISBN: | 0201648652 9780201648652 |
Staff View
MARC
| LEADER | 00000nam a2200000zc 4500 | ||
|---|---|---|---|
| 001 | BV014860350 | ||
| 003 | DE-604 | ||
| 005 | 20120314 | ||
| 007 | t | ||
| 008 | 021105s2003 xxud||| |||| 00||| eng d | ||
| 010 | |a 2002038351 | ||
| 020 | |a 0201648652 |9 0-201-64865-2 | ||
| 020 | |a 9780201648652 |9 978-0-201-64865-2 | ||
| 035 | |a (OCoLC)50937085 | ||
| 035 | |a (DE-599)BVBBV014860350 | ||
| 040 | |a DE-604 |b ger |e aacr | ||
| 041 | 0 | |a eng | |
| 044 | |a xxu |c US | ||
| 049 | |a DE-824 |a DE-703 |a DE-29T |a DE-739 |a DE-1051 |a DE-706 |a DE-355 |a DE-M347 | ||
| 050 | 0 | |a QA76.58 | |
| 082 | 0 | |a 005.2 |2 21 | |
| 084 | |a ST 130 |0 (DE-625)143588: |2 rvk | ||
| 084 | |a ST 151 |0 (DE-625)143595: |2 rvk | ||
| 084 | |a ST 200 |0 (DE-625)143611: |2 rvk | ||
| 245 | 1 | 0 | |a Introduction to parallel computing |c Ananth Grama ... |
| 250 | |a 2. ed. | ||
| 264 | 1 | |a Harlow ; Munich [u.a.] |b Addison-Wesley |c 2003 | |
| 300 | |a XX, 636 S. |b graph. Darst. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 500 | |a 1. Aufl. u.d.T: Introduction to parallel programming / Vipin Kumar ... Hier auch später erschienene, unveränderte Nachdrucke | ||
| 650 | 7 | |a Algorithme parallèle |2 rasuqam | |
| 650 | 7 | |a Ciência da computação |2 larpcal | |
| 650 | 7 | |a Parallélisme (Informatique) |2 rasuqam | |
| 650 | 7 | |a Processamento eletrônico de dados |2 larpcal | |
| 650 | 7 | |a Programmation parallèle |2 rasuqam | |
| 650 | 7 | |a Sistemas distribuídos |2 larpcal | |
| 650 | 7 | |a Softwares |2 larpcal | |
| 650 | 4 | |a Parallel algorithms | |
| 650 | 4 | |a Parallel processing (Electronic computers) | |
| 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 Grama, Ananth |e Sonstige |4 oth | |
| 856 | 4 | 2 | |m HEBIS Datenaustausch Mainz |q application/pdf |u http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=010049107&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |3 Inhaltsverzeichnis |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-010049107 | ||
Record in the Search Index
| _version_ | 1804129621526970368 |
|---|---|
| adam_text | ANANTH GRAMA * ANSHUL GUPTA GEORGE KARYPIS * VIPIN KUMAR INTRODUCTION TO
PARALLEL COMPUTING SECOND EDITION ADDISON-WESLEY AN IMPRINT OF PEARSON
EDUCATION HARLOW, ENGLAND * LONDON * NEW YORK * BOSTON * SAN FRANCISCO *
TORONTO SYDNEY * TOKYO * SINGAPORE * HONG KONG * SEOUL * TAIPEI * NEW
DELHI CAPE TOWN * MADRID * MEXICO CITY * AMSTERDAM * MUNICH * PARIS *
MILAN CONTENTS PREFACE XVII ACKNOWLEDGMENTS XIX CHAPTER 1 INTRODUCTION
TO PARALLEL COMPUTING 1 1.1 MOTIVATING PARALLELISM 2 1.1.1 THE
COMPUTATIONAL POWER ARGUMENT -FROM TRANSISTORS TO FLOPS 1.1.2 THE
MEMORY/DISK SPEED A RGUMENT 3 1.1.3 THE DATA COMMUNICATION ARGUMENT 4
1.2 SCOPE OF PARALLEL COMPUTING 4 1.2.1 APPLICATIONS IN ENGINEERING AND
DESIGN 4 1.2.2 SCIENTIFIC APPLICATIONS 5 1.2.3 COMMERCIAL APPLICATIONS 5
1.2.4 APPLICATIONS IN COMPUTER SYSTEMS 6 1.3 ORGANIZATION AND CONTENTS
OF THE TEXT 6 1.4 BIBLIOGRAPHIC REMARKS 8 PROBLEMS 9 CHAPTER 2 PARALLEL
PROGRAMMING PLATFORMS 11 2.1 IMPLICIT PARALLELISM: TRENDS IN
MICROPROCESSOR ARCHITECTURES 12 2.1.1 PIPELINING AND SUPERSCALAR
EXECUTION 12 2.1.2 VERY LONG INSTRUCTION WORD PROCESSORS 15 2.2
LIMITATIONS OF MEMORY SYSTEM PERFORMANCE* 16 2.2.1 IMPROVING EFFECTIVE
MEMORY LATENCY USING CACHES 17 2.2.2 IMPACT OF MEMORY BANDWIDTH 18 2.2.3
ALTERNATE APPROACHES FOR HIDING MEMORY LATENCY 21 VII VIII CONTENTS
2.2.4 TRADEOFFS OF MULTITHREADING AND PREFETCHING 23 2.3 DICHOTOMY OF
PARALLEL COMPUTING PLATFORMS 24 2.3.1 CONTROL STRUCTURE OF PARALLEL
PLATFORMS 25 2.3.2 COMMUNICATION MODEL OF PARALLEL PLATFORMS 27 2.4
PHYSICAL ORGANIZATION OF PARALLEL PLATFORMS 31 2.4.1 ARCHITECTURE OF AN
IDEAL PARALLEL COMPUTER 31 2.4.2 INTERCONNECTION NETWORKS FOR PARALLEL
COMPUTERS 32 2.4.3 NETWORK TOPOLOGIES 33 2.4.4 EVALUATING STATIC
INTERCONNECTION NETWORKS 43 2.4.5 EVALUATING DYNAMIC INTERCONNECTION
NETWORKS 44 2.4.6 CACHE COHERENCE IN MULTIPROCESSOR SYSTEMS 45 2.5
COMMUNICATION COSTS IN PARALLEL MACHINES 53 2.5.7 MESSAGE PASSING COSTS
IN PARALLEL COMPUTERS 53 2.5.2 COMMUNICATION COSTS IN
SHARED-ADDRESS-SPACE MACHINES 61 2.6 ROUTING MECHANISMS FOR
INTERCONNECTION NETWORKS 63 2.7 IMPACT OF PROCESS-PROCESSOR MAPPING AND
MAPPING TECHNIQUES 65 2.7.1 MAPPING TECHNIQUES FOR GRAPHS 66 2.7.2
COST-PERFORMANCE TRADEOFFS 73 2.8 BIBLIOGRAPHIC REMARKS 74 PROBLEMS 76
CHAPTER 3 PRINCIPLES OF PARALLEL ALGORITHM DESIGN 85 3.1 PRELIMINARIES
86 3.1.1 DECOMPOSITION, TASKS, AND DEPENDENCY GRAPHS 86 3.1.2
GRANULARITY, CONCURRENCY, AND TASK-INTERACTION 89 3.1.3 PROCESSES AND
MAPPING 93 3.1.4 PROCESSES VERSUS PROCESSORS 94 3.2 DECOMPOSITION
TECHNIQUES 95 3.2.1 RECURSIVE DECOMPOSITION 95 3.2.2 DATA DECOMPOSITION
97 3.2.3 EXPLORATORY DECOMPOSITION 105 3.2.4 SPECULATIVE DECOMPOSITION
107 3.2.5 HYBRID DECOMPOSITIONS 109 3.3 CHARACTERISTICS OF TASKS AND
INTERACTIONS 110 3.3.1 CHARACTERISTICS OF TASKS 110 3.3.2
CHARACTERISTICS OF INTER-TASK INTERACTIONS 112 3.4 MAPPING TECHNIQUES
FOR LOAD BALANCING 115 3.4.1 SCHEMES FOR STATIC MAPPING 117 3.4.2
SCHEMES FOR DYNAMIC MAPPING 130 CONTENTS IX 3.5 METHODS FOR CONTAINING
INTERACTION OVERHEADS 132 3.5.1 MAXIMIZING DATA LOCALITY 132 3.5.2
MINIMIZING CONTENTION AND HOT SPOTS 134 3.5.3 OVERLAPPING COMPUTATIONS
WITH INTERACTIONS 135 3.5.4 REPLICATING DATA OR COMPUTATIONS 136 3.5.5
USING OPTIMIZED COLLECTIVE INTERACTION OPERATIONS 137 3.5.6 OVERLAPPING
INTERACTIONS WITH OTHER INTERACTIONS 138 3.6 PARALLEL ALGORITHM MODELS
139 3.6.1 THE DATA-PARALLEL MODEL 139 3.6.2 THE TASK GRAPH MODEL 140
3.6.3 THE WORK POOL MODEL 140 3.6.4 THE MASTER-SLAVE MODEL 141 3.6.5 THE
PIPELINE OR PRODUCER-CONSUMER MODEL 141 3.6.6 HYBRID MODELS 142 3.7
BIBLIOGRAPHIC REMARKS 142 PROBLEMS 143 CHAPTER 4 BASIC COMMUNICATION
OPERATIONS 147 4.1 ONE-TO-ALL BROADCAST AND ALL-TO-ONE REDUCTION 149 4.2
4.3 4.4 4.5 4.6 4.1.1 4.1.2 4.1.3 4.1.4 4.1.5 4.1.6 RING OR LINEAR ARRAY
149 MESH 152 HYPERCUBE 153 BALANCED BINARY TREE 153 DETAILED ALGORITHMS
154 COST ANALYSIS 156 ALL-TO-ALL BROADCAST AND REDUCTION 157 4.2.1 4.2.2
4.2.3 4.2.4 LINEAR ARRAY AND RING 158 MESH 160 HYPERCUBE 161 COST
ANALYSIS 164 ALL-REDUCE AND PREFIX-SUM OPERATIONS 166 SCATTER AND GATHER
167 ALL-TO-ALL PERSONALIZED COMMUNICATION 170 4.5.1 4.5.2 4.5.3 RING 173
MESH 174 HYPERCUBE 175 CIRCULAR SHIFT 179 4.6.1 4.6.2 MESH 179 HYPERCUBE
181 X CONTENTS 4.7 IMPROVING THE SPEED OF SOME COMMUNICATION OPERATIONS
184 4.7.1 SPLITTING AND ROUTING MESSAGES IN PARTS 184 4.7.2 ALL-PORT
COMMUNICATION 186 4.8 SUMMARY 187 4.9 BIBLIOGRAPHIC REMARKS 188 PROBLEMS
190 CHAPTER 5 ANALYTICAL MODELING OF PARALLEL PROGRAMS 195 5.1 SOURCES
OF OVERHEAD IN PARALLEL PROGRAMS 195 5.2 PERFORMANCE METRICS FOR
PARALLEL SYSTEMS 197 5.2.1 EXECUTION TIME 197 5.2.2 TOTAL PARALLEL
OVERHEAD 197 5.2.3 SPEEDUP 198 5.2.4 EFFICIENCY 202 5.2.5 COST 203 5.3
THE EFFECT OF GRANULARITY ON PERFORMANCE 205 5.4 SCALABILITY OF PARALLEL
SYSTEMS 208 5.4.1 SCALING CHARACTERISTICS OF PARALLEL PROGRAMS 209 5.4.2
THE ISOEFFICIENCY METRIC OF SCALABILITY 212 5.4.3 COST-OPTIMALITY AND
THE ISOEFFICIENCY FUNCTION 217 5.4.4 A LOWER BOUND ON THE ISOEFFICIENCY
FUNCTION 217 5.4.5 THE DEGREE OF CONCURRENCY AND THE ISOEFFICIENCY
FUNCTION 218 5.5 MINIMUM EXECUTION TIME AND MINIMUM COST-OPTIMAL
EXECUTION TIME 218 5.6 ASYMPTOTIC ANALYSIS OF PARALLEL PROGRAMS 221 5.7
OTHER SCALABILITY METRICS 222 5.8 BIBLIOGRAPHIC REMARKS 226 PROBLEMS 228
CHAPTER 6 PROGRAMMING USING THE MESSAGE-PASSING PARADIGM 233 6.1
PRINCIPLES OF MESSAGE-PASSING PROGRAMMING 233 6.2 THE BUILDING BLOCKS:
SEND AND RECEIVE OPERATIONS 235 6.2.7 BLOCKING MESSAGE PASSING
OPERATIONS 236 6.2.2 NON-BLOCKING MESSAGE PASSING OPERATIONS 239 6.3
MPI: THE MESSAGE PASSING INTERFACE 240 CONTENTS XI 6.3.1 STARTING AND
TERMINATING THE MPI LIBRARY 242 6.3.2 COMMUNICATORS 242 6.3.3 GETTING
INFORMATION 243 6.3.4 SENDING AND RECEIVING MESSAGES 244 6.3.5 EXAMPLE:
ODD-EVEN SORT 248 6.4 TOPOLOGIES AND EMBEDDING 250 6.4.1 CREATING AND
USING CARTESIAN TOPOLOGIES 251 6.4.2 EXAMPLE: CANNON S MATRIX-MATRIX
MULTIPLICATION 253 6.5 OVERLAPPING COMMUNICATION WITH COMPUTATION 255
6.5.7 NON-BLOCKING COMMUNICATION OPERATIONS 255 6.6 COLLECTIVE
COMMUNICATION AND COMPUTATION OPERATIONS 260 6.6.7 BARRIER 260 6.6.2
BROADCAST 260 6.6.3 REDUCTION 261 6.6.4 PREFIX 263 6.6.5 GATHER 263
6.6.6 SCATTER 264 6.6.7 ALL-TO-ALL 265 6.6.8 EXAMPLE: ONE-DIMENSIONAL
MATRIX-VECTOR MULTIPLICATION 266 6.6.9 EXAMPLE: SINGLE-SOURCE
SHORTEST-PATH 268 6.6.10 EXAMPLE: SAMPLE SORT 270 6.7 GROUPS AND
COMMUNICATORS 272 6.7.7 EXAMPLE: TWO-DIMENSIONAL MATRIX-VECTOR
MULTIPLICATION 274 6.8 BIBLIOGRAPHIC REMARKS 276 PROBLEMS 277 CHAPTER 7
PROGRAMMING SHARED ADDRESS SPACE PLATFORMS 279 7.1 THREAD BASICS 280 7.2
WHY THREADS? 281 7.3 THE POSIX THREAD API 282 7.4 THREAD BASICS:
CREATION AND TERMINATION 282 7.5 SYNCHRONIZATION PRIMITIVES IN PTHREADS
287 7.5.7 MUTUAL EXCLUSION FOR SHARED VARIABLES 287 7.5.2 CONDITION
VARIABLES FOR SYNCHRONIZATION 294 7.6 CONTROLLING THREAD AND
SYNCHRONIZATION ATTRIBUTES 298 7.6.7 ATTRIBUTES OBJECTS FOR THREADS 299
7.6.2 ATTRIBUTES OBJECTS FOR MUTEXES 300 XII CONTENTS 7.7 THREAD
CANCELLATION 301 7.8 COMPOSITE SYNCHRONIZATION CONSTRUCTS 302 7.8.1
READ-WRITE LOCKS 302 7.8.2 BARRIERS 307 7.9 TIPS FOR DESIGNING
ASYNCHRONOUS PROGRAMS 310 7.10 OPENMP: A STANDARD FOR DIRECTIVE BASED
PARALLEL PROGRAMMING 311 7.10.1 THE OPENMP PROGRAMMING MODEL 312 7.10.2
SPECIFYING CONCURRENT TASKS IN OPENMP 315 7.10.3 SYNCHRONIZATION
CONSTRUCTS IN OPENMP 322 7.10.4 DATA HANDLING IN OPENMP 327 7.10.5
OPENMP LIBRARY FUNCTIONS 328 7.10.6 ENVIRONMENT VARIABLES IN OPENMP 330
7.10.7 EXPLICIT THREADS VERSUS OPENMP BASED PROGRAMMING 331 7.11
BIBLIOGRAPHIC REMARKS 332 PROBLEMS 332 CHAPTER 8 DENSE MATRIX ALGORITHMS
337 8.1 MATRIX-VECTOR MULTIPLICATION 337 &7.7 ROWWISE 1-D PARTITIONING
338 8.1.2 2-D PARTITIONING 341 8.2 MATRIX-MATRIX MULTIPLICATION 345
8.2.7 A SIMPLE PARALLEL ALGORITHM 346 8.2.2 CANNON S ALGORITHM 34 7
8.2.3 THE DNS ALGORITHM 349 8.3 SOLVING A SYSTEM OF LINEAR EQUATIONS 352
8.3.1 A SIMPLE GAUSSIAN ELIMINATION ALGORITHM 353 8.3.2 GAUSSIAN
ELIMINATION WITH PARTIAL PIVOTING 366 8.3.3 SOLVING A TRIANGULAR SYSTEM:
BACK-SUBSTITUTION 369 8.3.4 NUMERICAL CONSIDERATIONS IN SOLVING SYSTEMS
OF LINEAR EQUATIONS 370 8.4 BIBLIOGRAPHIC REMARKS 371 PROBLEMS 372
CHAPTER 9 SORTING 379 9.1 ISSUES IN SORTING ON PARALLEL COMPUTERS 380
9.7.7 WHERE THE INPUT AND OUTPUT SEQUENCES ARE STORED 380 9.1.2 HOW
COMPARISONS ARE PERFORMED 380 CONTENTS XIII 9.2 SORTING NETWORKS 382
9.2.7 BITONICSORT 384 9.2.2 MAPPING BITONIC SORT TO A HYPERCUBE AND A
MESH 387 9.3 BUBBLE SORT AND ITS VARIANTS 394 9.3.1 ODD-EVEN
TRANSPOSITION 395 9.3.2 SHELLSORT 398 9.4 QUICKSORT 399 9.4.1
PARALLELIZING QUICKSORT 401 9.4.2 PARALLEL FORMULATION FOR A CRCW PRAM
402 9.4.3 PARALLEL FORMULATION FOR PRACTICAL ARCHITECTURES 404 9.4.4
PIVOT SELECTION 411 9.5 BUCKET AND SAMPLE SORT 412 9.6 OTHER SORTING
ALGORITHMS 414 9.6.7 ENUMERATION SORT 414 9.6.2 RADIX SORT 415 9.7
BIBLIOGRAPHIC REMARKS 416 PROBLEMS 419 CHAPTER 10 GRAPH ALGORITHMS 429
10.1 DEFINITIONS AND REPRESENTATION 429 10.2 MINIMUM SPANNING TREE:
PRIM S ALGORITHM 432 10.3 SINGLE-SOURCE SHORTEST PATHS: DIJKSTRA S
ALGORITHM 436 10.4 ALL-PAIRS SHORTEST PATHS 437 10.4.1 DIJKSTRA S
ALGORITHM 438 10.4.2 FLOYD S ALGORITHM 440 10.4.3 PERFORMANCE
COMPARISONS 445 10.5 TRANSITIVE CLOSURE 445 10.6 CONNECTED COMPONENTS
446 70.6.7 A DEPTH-FIRST SEARCH BASED ALGORITHM 446 10.7 ALGORITHMS FOR
SPARSE GRAPHS 450 10.7.1 FINDING A MAXIMAL INDEPENDENT SET 451 10.7.2
SINGLE-SOURCE SHORTEST PATHS 455 10.8 BIBLIOGRAPHIC REMARKS 462 PROBLEMS
465 XIV CONTENTS CHAPTER 11 SEARCH ALGORITHMS FOR DISCRETE OPTIMIZATION
PROBLEMS 469 11.1 DEFINITIONS AND EXAMPLES 469 11.2 SEQUENTIAL SEARCH
ALGORITHMS 474 77.2.7 DEPTH-FIRST SEARCH ALGORITHMS 474 11.2.2
BEST-FIRST SEARCH ALGORITHMS 478 11.3 SEARCH OVERHEAD FACTOR 478 11.4
PARALLEL DEPTH-FIRST SEARCH 480 77.4.7 IMPORTANT PARAMETERS OF PARALLEL
DFS 482 11.4.2 A GENERAL FRAMEWORK FOR ANALYSIS OF PARALLEL DFS 485
11.4.3 ANALYSIS OF LOAD-BALANCING SCHEMES 488 11.4.4 TERMINATION
DETECTION 490 11.4.5 EXPERIMENTAL RESULTS 492 11.4.6 PARALLEL
FORMULATIONS OF DEPTH-FIRST BRANCH-AND-BOUND SEARCH 495 11.4.7 PARALLEL
FORMULATIONS OF IDA* 496 11.5 PARALLEL BEST-FIRST SEARCH 496 11.6
SPEEDUP ANOMALIES IN PARALLEL SEARCH ALGORITHMS 501 11.6.1 ANALYSIS OF
AVERAGE SPEEDUP IN PARALLEL DFS 502 11.7 BIBLIOGRAPHIC REMARKS 505
PROBLEMS 510 CHAPTER 12 DYNAMIC PROGRAMMING 515 12.1 OVERVIEW OF DYNAMIC
PROGRAMMING 515 12.2 SERIAL MONADIC DP FORMULATIONS 518 72.2.7 THE
SHORTEST-PATH PROBLEM 518 12.2.2 THE 0/1 KNAPSACK PROBLEM 520 12.3
NONSERIAL MONADIC DP FORMULATIONS 523 12.3.1 THE
LONGEST-COMMON-SUBSEQUENCE PROBLEM 523 12.4 SERIAL POLYADIC DP
FORMULATIONS 526 12.4.1 FLOYD S ALL-PAIRS SHORTEST-PATHS ALGORITHM 526
12.5 NONSERIAL POLYADIC DP FORMULATIONS 527 12.5.1 THE OPTIMAL
MATRIX-PARENTHESIZATION PROBLEM 527 12.6 SUMMARY AND DISCUSSION 530 12.7
BIBLIOGRAPHIC REMARKS 531 PROBLEMS 532 CONTENTS XV CHAPTER 13 FAST
FOURIER TRANSFORM 537 13.1 THE SERIAL ALGORITHM 538 13.2 THE
BINARY-EXCHANGE ALGORITHM 541 7J.2.7 A FULL BANDWIDTH NETWORK 541 13.2.2
LIMITED BANDWIDTH NETWORK 548 13.2.3 EXTRA COMPUTATIONS IN PARALLEL FFT
551 13.3 THE TRANSPOSE ALGORITHM 553 13.3.1 TWO-DIMENSIONAL TRANSPOSE
ALGORITHM 553 13.3.2 THE GENERALIZED TRANSPOSE ALGORITHM 556 13.4
BIBLIOGRAPHIC REMARKS 560 PROBLEMS 562 APPENDIX A COMPLEXITY OF
FUNCTIONS AND ORDER ANALYSIS 565 A.I COMPLEXITY OF FUNCTIONS 565 A.2
ORDER ANALYSIS OF FUNCTIONS 566 BIBLIOGRAPHY 569 AUTHOR INDEX 611
SUBJECT INDEX 621
|
| any_adam_object | 1 |
| building | Verbundindex |
| bvnumber | BV014860350 |
| 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 151 ST 200 |
| ctrlnum | (OCoLC)50937085 (DE-599)BVBBV014860350 |
| dewey-full | 005.2 |
| dewey-hundreds | 000 - Computer science, information, general works |
| dewey-ones | 005 - Computer programming, programs, data, security |
| dewey-raw | 005.2 |
| dewey-search | 005.2 |
| dewey-sort | 15.2 |
| dewey-tens | 000 - Computer science, information, general works |
| discipline | Informatik |
| edition | 2. ed. |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>02130nam a2200541zc 4500</leader><controlfield tag="001">BV014860350</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20120314 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">021105s2003 xxud||| |||| 00||| eng d</controlfield><datafield tag="010" ind1=" " ind2=" "><subfield code="a">2002038351</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">0201648652</subfield><subfield code="9">0-201-64865-2</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9780201648652</subfield><subfield code="9">978-0-201-64865-2</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)50937085</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV014860350</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="044" ind1=" " ind2=" "><subfield code="a">xxu</subfield><subfield code="c">US</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-824</subfield><subfield code="a">DE-703</subfield><subfield code="a">DE-29T</subfield><subfield code="a">DE-739</subfield><subfield code="a">DE-1051</subfield><subfield code="a">DE-706</subfield><subfield code="a">DE-355</subfield><subfield code="a">DE-M347</subfield></datafield><datafield tag="050" ind1=" " ind2="0"><subfield code="a">QA76.58</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">005.2</subfield><subfield code="2">21</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 151</subfield><subfield code="0">(DE-625)143595:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">ST 200</subfield><subfield code="0">(DE-625)143611:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Introduction to parallel computing</subfield><subfield code="c">Ananth Grama ...</subfield></datafield><datafield tag="250" ind1=" " ind2=" "><subfield code="a">2. ed.</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Harlow ; Munich [u.a.]</subfield><subfield code="b">Addison-Wesley</subfield><subfield code="c">2003</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">XX, 636 S.</subfield><subfield code="b">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="500" ind1=" " ind2=" "><subfield code="a">1. Aufl. u.d.T: Introduction to parallel programming / Vipin Kumar ... Hier auch später erschienene, unveränderte Nachdrucke</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Algorithme parallèle</subfield><subfield code="2">rasuqam</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Ciência da computação</subfield><subfield code="2">larpcal</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Parallélisme (Informatique)</subfield><subfield code="2">rasuqam</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Processamento eletrônico de dados</subfield><subfield code="2">larpcal</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Programmation parallèle</subfield><subfield code="2">rasuqam</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Sistemas distribuídos</subfield><subfield code="2">larpcal</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Softwares</subfield><subfield code="2">larpcal</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Parallel algorithms</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Parallel processing (Electronic computers)</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">Grama, Ananth</subfield><subfield code="e">Sonstige</subfield><subfield code="4">oth</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="m">HEBIS Datenaustausch Mainz</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=010049107&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-010049107</subfield></datafield></record></collection> |
| genre | (DE-588)4151278-9 Einführung gnd-content |
| genre_facet | Einführung |
| id | DE-604.BV014860350 |
| illustrated | Illustrated |
| indexdate | 2024-07-09T19:08:03Z |
| institution | BVB |
| isbn | 0201648652 9780201648652 |
| language | English |
| lccn | 2002038351 |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-010049107 |
| oclc_num | 50937085 |
| open_access_boolean | |
| owner | DE-824 DE-703 DE-29T DE-739 DE-1051 DE-706 DE-355 DE-BY-UBR DE-M347 |
| owner_facet | DE-824 DE-703 DE-29T DE-739 DE-1051 DE-706 DE-355 DE-BY-UBR DE-M347 |
| physical | XX, 636 S. graph. Darst. |
| publishDate | 2003 |
| publishDateSearch | 2003 |
| publishDateSort | 2003 |
| publisher | Addison-Wesley |
| record_format | marc |
| spelling | Introduction to parallel computing Ananth Grama ... 2. ed. Harlow ; Munich [u.a.] Addison-Wesley 2003 XX, 636 S. graph. Darst. txt rdacontent n rdamedia nc rdacarrier 1. Aufl. u.d.T: Introduction to parallel programming / Vipin Kumar ... Hier auch später erschienene, unveränderte Nachdrucke Algorithme parallèle rasuqam Ciência da computação larpcal Parallélisme (Informatique) rasuqam Processamento eletrônico de dados larpcal Programmation parallèle rasuqam Sistemas distribuídos larpcal Softwares larpcal Parallel algorithms Parallel processing (Electronic computers) Parallelverarbeitung (DE-588)4075860-6 gnd rswk-swf (DE-588)4151278-9 Einführung gnd-content Parallelverarbeitung (DE-588)4075860-6 s DE-604 Grama, Ananth Sonstige oth HEBIS Datenaustausch Mainz application/pdf http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=010049107&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA Inhaltsverzeichnis |
| spellingShingle | Introduction to parallel computing Algorithme parallèle rasuqam Ciência da computação larpcal Parallélisme (Informatique) rasuqam Processamento eletrônico de dados larpcal Programmation parallèle rasuqam Sistemas distribuídos larpcal Softwares larpcal Parallel algorithms Parallel processing (Electronic computers) Parallelverarbeitung (DE-588)4075860-6 gnd |
| subject_GND | (DE-588)4075860-6 (DE-588)4151278-9 |
| title | Introduction to parallel computing |
| title_auth | Introduction to parallel computing |
| title_exact_search | Introduction to parallel computing |
| title_full | Introduction to parallel computing Ananth Grama ... |
| title_fullStr | Introduction to parallel computing Ananth Grama ... |
| title_full_unstemmed | Introduction to parallel computing Ananth Grama ... |
| title_short | Introduction to parallel computing |
| title_sort | introduction to parallel computing |
| topic | Algorithme parallèle rasuqam Ciência da computação larpcal Parallélisme (Informatique) rasuqam Processamento eletrônico de dados larpcal Programmation parallèle rasuqam Sistemas distribuídos larpcal Softwares larpcal Parallel algorithms Parallel processing (Electronic computers) Parallelverarbeitung (DE-588)4075860-6 gnd |
| topic_facet | Algorithme parallèle Ciência da computação Parallélisme (Informatique) Processamento eletrônico de dados Programmation parallèle Sistemas distribuídos Softwares Parallel algorithms Parallel processing (Electronic computers) Parallelverarbeitung Einführung |
| url | http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=010049107&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |
| work_keys_str_mv | AT gramaananth introductiontoparallelcomputing |