Parallel and distributed computing handbook:
Gespeichert in:
| Format: | Buch |
|---|---|
| Sprache: | English |
| Veröffentlicht: |
New York [u.a.]
McGraw-Hill
1996
|
| Schriftenreihe: | Computer engineering series
|
| Schlagworte: | |
| Online-Zugang: | Table of contents Inhaltsverzeichnis |
| Beschreibung: | XXX, 1199 S. Ill., graph. Darst. |
| ISBN: | 0070730202 |
Internformat
MARC
| LEADER | 00000nam a2200000 c 4500 | ||
|---|---|---|---|
| 001 | BV010585105 | ||
| 003 | DE-604 | ||
| 005 | 19960221 | ||
| 007 | t | ||
| 008 | 960125s1996 xxuad|| |||| 00||| engod | ||
| 020 | |a 0070730202 |9 0-07-073020-2 | ||
| 035 | |a (OCoLC)32820483 | ||
| 035 | |a (DE-599)BVBBV010585105 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 044 | |a xxu |c XD-US | ||
| 049 | |a DE-91 |a DE-91G |a DE-20 |a DE-29T |a DE-384 |a DE-739 |a DE-521 |a DE-634 |a DE-83 |a DE-11 | ||
| 050 | 0 | |a QA76.58.P3635 1996 | |
| 082 | 0 | |a 004/.35 |2 20 | |
| 082 | 0 | |a 004/.35 20 | |
| 084 | |a ST 200 |0 (DE-625)143611: |2 rvk | ||
| 084 | |a ST 230 |0 (DE-625)143617: |2 rvk | ||
| 084 | |a DAT 516f |2 stub | ||
| 084 | |a DAT 250f |2 stub | ||
| 245 | 1 | 0 | |a Parallel and distributed computing handbook |c Albert Y. Zomaya, ed. |
| 264 | 1 | |a New York [u.a.] |b McGraw-Hill |c 1996 | |
| 300 | |a XXX, 1199 S. |b Ill., graph. Darst. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 0 | |a Computer engineering series | |
| 650 | 7 | |a ATM |2 inriac | |
| 650 | 7 | |a Gedistribueerde gegevensverwerking |2 gtt | |
| 650 | 7 | |a MIND |2 inriac | |
| 650 | 7 | |a P-RAM |2 inriac | |
| 650 | 7 | |a Parallelle verwerking |2 gtt | |
| 650 | 7 | |a Parallélisme (informatique) |2 ram | |
| 650 | 7 | |a Programmation parallèle (informatique) |2 ram | |
| 650 | 7 | |a Programmation parallèle |2 ram | |
| 650 | 7 | |a RISC |2 inriac | |
| 650 | 7 | |a SIMD |2 inriac | |
| 650 | 7 | |a Traitement réparti |2 ram | |
| 650 | 7 | |a VLIW |2 inriac | |
| 650 | 7 | |a algorithme génétique |2 inriac | |
| 650 | 7 | |a algorithme parallèle |2 inriac | |
| 650 | 7 | |a architecture flot donnée |2 inriac | |
| 650 | 7 | |a calcul scientifique |2 inriac | |
| 650 | 7 | |a concurrence |2 inriac | |
| 650 | 7 | |a graphe parallèle |2 inriac | |
| 650 | 7 | |a hypercube |2 inriac | |
| 650 | 7 | |a interconnexion réseau |2 inriac | |
| 650 | 7 | |a langage parallèle |2 inriac | |
| 650 | 7 | |a méthode formelle |2 inriac | |
| 650 | 7 | |a processeur VLSI |2 inriac | |
| 650 | 7 | |a robotique |2 inriac | |
| 650 | 7 | |a super-calculateur |2 inriac | |
| 650 | 7 | |a système ouvert |2 inriac | |
| 650 | 7 | |a système parallèle |2 inriac | |
| 650 | 7 | |a système réparti |2 inriac | |
| 650 | 7 | |a système événement discret |2 inriac | |
| 650 | 4 | |a Datenverarbeitung | |
| 650 | 4 | |a Parallel processing (Electronic computers) | |
| 650 | 4 | |a Electronic data processing -- Distributed processing | |
| 650 | 0 | 7 | |a Verteiltes System |0 (DE-588)4238872-7 |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 | |5 DE-604 | |
| 689 | 1 | 0 | |a Verteiltes System |0 (DE-588)4238872-7 |D s |
| 689 | 1 | |5 DE-604 | |
| 700 | 1 | |a Zomaya, Albert Y. |d 1964- |e Sonstige |0 (DE-588)135767342 |4 oth | |
| 856 | 4 | |u http://www.loc.gov/catdir/toc/mh022/95032594.html |3 Table of contents | |
| 856 | 4 | 2 | |m GBV Datenaustausch |q application/pdf |u http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=007057595&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |3 Inhaltsverzeichnis |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-007057595 | ||
Datensatz im Suchindex
| _version_ | 1804125054851612672 |
|---|---|
| adam_text | IMAGE 1
PARALLEL AND DISTRIBUTED
COMPUTING HANDBOOK
ALBERT Y. ZOMAYA, EDITOR
MCGRAW-HILL
NEW YORK SAN FRANCISCO WASHINGTON, D.C. AUCKLAND BOGOTA CARACAS LISBON
LONDON MADRID MEXICO CITY MILAN MONTREAL NEW DELHI SAN JUAN SINGAPORE
SYDNEY TOKYO TORONTO
IMAGE 2
CONTENTS
FOREWORD XIX
PREFACE XXI
ACKNOWLEDGMENTS XXIII LIST OF CONTRIBUTORS XXV
PART I THEORY
FOUNDATIONS
CHAPTER 1. PARALLEL AND DISTRIBUTED COMPUTING: THE SCENE, THE PROPS, THE
PLAYERS 5 ALBERT Y. ZOMAYA
1.1 A PERSPECTIVE
1.2 PARALLEL PROCESSING PARADIGMS 7
1.3 MODELING AND CHARACTERIZING PARALLEL ALGORITHMS 11
1.4 COST VS. PERFORMANCE EVALUATION 13
1.5 SOFTWARE AND GENERAL-PURPOSE PDC 15
1.6 A BRIEF OUTLINE OF THE HANDBOOK 16
1.7 RECOMMENDED READING 19
1.8 REFERENCES 21
CHAPTER 2. SEMANTICS OF CONCURRENT PROGRAMMING 24
J. DESHARNAIS, A. MILI, R. MILI, J. MULLINS, AND Y. SLIMANI
2.1 MODELS OF CONCURRENT PROGRAMMING 25
2.2 SEMANTIC DEFINITIONS 27
IMAGE 3
VIII PARALLEL AND DISTRIBUTED COMPUTING
2.3 AXIOMATIC SEMANTIC DEFINITIONS 30
2.4 DENOTATIONAL SEMANTIC DEFINITIONS 36
2.5 OPERATIONAL SEMANTIC DEFINITIONS 54
2.6 SUMMARY AND PROSPECTS 57
2.7 REFERENCES 57
CHAPTER 3. FORMAL METHODS: A PETRI NETS BASED APPROACH 59
GIORGIO DE MICHELIS, LUCIA POMELLO, EUGENIO BATTISTON, FIORELLA DE
CINDIO, AND CARLA SIMONE
3.1 PROCESS ALGEBRAS 61
3.2 PETRI NETS 68
3.3 HIGH-LEVEL NET MODELS 78
3.4 CONCLUSIONS 84
3.5 REFERENCES 86
CHAPTER 4. COMPLEXITY ISSUES IN PARALLEL AND DISTRIBUTED COMPUTING 89
E. V. KRISHNAMURTHY
4.1 INTRODUCTION 89
4.2 TURING MACHINE AS THE BASIS, AND CONSEQUENCES 93
4.3 COMPLEXITY MEASURES FOR PARALLELISM 101
4.4 PARALLEL COMPLEXITY MODELS AND RESULTING CLASSES 103
4.5 VLSI COMPUTATIONAL COMPLEXITY 121
4.6 COMPLEXITY MEASURES FOR DISTRIBUTED SYSTEMS 121
4.7 NEURAL NETWORKS AND COMPLEXITY ISSUES 121
4.8 OTHER COMPLEXITY THEORIES 123
4.9 CONCLUDING REMARKS 124
4.10 REFERENCES 125
CHAPTER 5. DISTRIBUTED COMPUTING THEORY 127
HAGIT ATTIYA
5.1 THE COMPUTATION MODEL 129
5.2 A SIMPLE EXAMPLE 131
5.3 LEADER ELECTION 132
5.4 SPARSE NETWORK COVERS AND THEIR APPLICATIONS 138
5.5 ORDERING OF EVENTS 142
5.6 RESOURCE ALLOCATION 146
5.7 TOLERATING PROCESSOR FAILURES IN SYNCHRONOUS SYSTEMS 146
5.8 TOLERATING PROCESSOR FAILURES IN ASYNCHRONOUS SYSTEMS 151
5.9 OTHER TYPES OF FAILURES 154
5.10 WAIT-FREE IMPLEMENTATIONS OF SHARED OBJECTS 156
5.11 FINAL COMMENTS 157
5.12 REFERENCES 158
IMAGE 4
CONTENTS IX
MODELS
CHAPTER 6. PRAM MODELS 163
LYDIA I. KRONSJOE
6.1 INTRODUCTION 163
6.2 TECHNIQUES FOR THE DESIGN OF PARALLEL ALGORITHMS 165
6.3 THE PRAM MODEL 168
6.4 OPTIMALITY AND EFFICIENCY OF PARALLEL ALGORITHMS 171
6.5 BASIC PRAM ALGORITHMS 175
6.6 THE NC-CLASS 180
6.7 P-COMPLETENESS: HARDLY PARAIIELIZABLE PROBLEMS 180
6.8 RANDOMIZED ALGORITHMS AND PARALLELISM 181
6.9 LIST RANKING REVISITED: OPTIMAL 0(LOG N) DETERMINISTIC LIST RANKING
184 6.10 TAXONOMY OF PARALLEL ALGORITHMS 186
6.11 DEFICIENCIES OF THE PRAM MODEL 186
6.12 SUMMARY 189
6.13 REFERENCES 189
CHAPTER 7. BROADCASTING WITH SELECTIVE REDUCTION: A POWERFUI MODEL OF
PARALLEL COMPUTATION 192
SELIM G. AKL AND IVAN STOJMENOVIC
7.1 INTRODUCTION 192
7.2 A GENERALIZED BSR MODEL 197
7.3 ONE CRITERION BSR ALGORITHMS 200
7.4 TWO CRITERIA BSR ALGORITHMS 212
7.5 THREE CRITERIA BSR ALGORITHMS 215
7.6 MULTIPLE CRITERIA BSR ALGORITHMS 218
7.7 CONCLUSIONS AND FUTURE WORK 220
7.8 REFERENCES 221
CHAPTER 8. DATAFLOW MODELS 223
R. JAGANNATHAN
8.1 KINDS OF DATAFLOW 224
8.2 DATA-DRIVEN DATAFLOW COMPUTING MODELS 225
8.3 DEMAND-DRIVEN DATAFLOW COMPUTING MODELS 230
8.4 UNIFYING DATA-DRIVEN AND DEMAND-DRIVEN 234
8.5 LESSONS LEARNED AND FUTURE TRENDS 235
8.6 SUMMARY 236
8.7 REFERENCES 237
CHAPTER 9. PARTITIONING AND SCHEDULING 239
HESHAM EL-REWINI
9.1 PROGRAM PARTITIONING 241
9.2 TASK SCHEDULING 243
IMAGE 5
X PARALLEL AND DISTRIBUTED COMPUTING
9.3 SCHEDULING SYSTEM MODEL 244
9.4 COMMUNICATION MODELS 248
9.5 OPTIMAL SCHEDULING ALGORITHMS 249
9.6 SCHEDULING HEURISTIC ALGORITHMS 255
9.7 SCHEDULING NONDETERMINISTIC TASK GRAPHS 262
9.8 SCHEDULING TOOLS 266
9.9 TASK ALLOCATION 267
9.10 HETEROGENEOUS ENVIRONMENTS 268
9.11 SUMMARY AND CONCLUDING REMARKS 270
9.12 REFERENCES 272
CHAPTER 10. CHECKPOINTING IN PARALLEL AND DISTRIBUTED SYSTEMS 274
AV Z/V AND JEHOSHUA BRUECK
10.1 INTRODUCTION 274
10.2 CHECKPOINTING USING TASK DUPLICATION 276
10.3 TECHNIQUES FOR CONSISTENT CHECKPOINTING 288
10.4 CONCLUSIONS AND FUTURE DIRECTIONS 299
10.5 REFERENCES 300
CHAPTER 11. ARCHITECTURE FOR OPEN DISTRIBUTED SOFTWARE SYSTEMS 303
KAZI FAROOQUI AND LUIGI LOGRIPPO
11.1 INTRODUCTION TO OPEN DISTRIBUTED SYSTEMS ARCHITECTURE 303
11.2 COMPUTATIONAL MODEL 307
11.3 ENGINEERING MODEL 315
11.4 ODP APPLICATION 324
11.5 CONCLUSION AND DIRECTIONS FOR FUTURE RESEARCH 327
11.6 REFERENCES 328
ALGORITHMS
CHAPTER 12. FUNDAMENTALS OF PARALLEL ALGORITHMS 333
JOSEPH F. JAEJAE
12.1 INTRODUCTION 333
12.2 MODELS OF PARALLEL COMPUTATION 334
12.3 BALANCED TREES 339
12.4 DIVIDE AND CONQUER 342
12.5 PARTITIONING 345
12.6 COMBINING 350
12.7 CONCLUSIONS AND FUTURE TRENDS 353
12.8 ACKNOWLEDGMENT 354
12.9 REFERENCES 354
IMAGE 6
CONTENTS XI
CHAPTER 13. PARALLEL GRAPH ALGORITHMS 355
STEPHAN OLAHU
13.1 GRAPH-THEORETIC CONCEPTS AND NOTATION 356
13.2 TREE ALGORITHMS 358
13.3 ALGORITHMS FOR GENERAL GRAPHS 372
13.4 ALGORITHMS FOR PARTICULAR CLASSES OF GRAPHS 384
13.5 CONCLUDING REMARKS 401
13.6 REFERENCES 402
CHAPTER 14. PARALLEL COMPUTATIONAL GEOMETRY 404
MIKHALL J. ATALLAH
14.1 PARALLEL CG: WHY NEW TECHNIQUES ARE NEEDED 405
14.2 BASIC SUBPROBLEMS 407
14.3 CG ON THE PRAM 409
14.4 CG ON THE MESH 416
14.5 CG ON THE HYPERCUBE 419
14.6 OTHER PARALLEL MODELS 420
14.7 CONCLUSIONS AND FUTURE WORK 422
14.8 REFERENCES 423
CHAPTER 15. DATA STRUCTURES FOR PARALLEL PROCESSING 429
SAJAL K. DAS AND KWANG-BAE MIN
15.1 ARRAYS AND BALANCED BINARY TREES 430
15.2 LINKED LISTS 432
15.3 TREES AND EULER TOUR 434
15.4 GENERAL TREES AND BINARIZED TREES 435
15.5 EULER TOUR VS. PARENTHESES STRING 436
15.6 STACKS 440
15.7 QUEUES 445
15.8 PRIORITY QUEUES (HEAPS) 448
15.9 SEARCH TREES/DICTIONARIES 455
15.10 CONCLUSIONS 463
15.11 REFERENCES 464
CHAPTER 16. DATA PARALLEL ALGORITHMS 466
HOWARD JAY SIEGEL, LEE WANG, JOHN JOHN E. SO, AND MUTHUCUMARU MAHESWARAN
16.1 CHAPTER OVERVIEW 466
16.2 MACHINE MODEL 467
16.3 IMPACT OF DATA DISTRIBUTION 469
16.4 CU/PEOVERLAP 476
16.5 PARALLEL REDUCTION OPERATIONS 480
16.6 MATRIX AND VECTOR OPERATIONS 487
IMAGE 7
XII PARALLEL AND DISTRIBUTED COMPUTING
16.7 MAPPING ALGORITHMS ONTO PARTITIONABLE MACHINES 489
16.8 ACHIEVING SCALABILITY USING A SET OF ALGORITHMS 492
16.9 CONCLUSIONS AND FUTURE DIRECTIONS 494
16.10 REFERENCES 497
CHAPTER 17. SYSTOLIC AND VLSI PROCESSOR ARRAYS FOR MATRIX ALGORITHMS 500
D. J. EVANS AND M. GUSEV
17.1 PROCESSOR ARRAY IMPLEMENTATIONS 500
17.2 VLSI PROCESSOR ARRAYS 501
17.3 SYSTOLIC ARRAY ALGORITHMS 508
17.4 MATHEMATICAL METHODS IN DSP 510
17.5 IMPLEMENTATION OF SYSTOLIC ALGORITHMS IN DSP 517
17.6 CONJUGATE GRADIENT METHOD 530
17.7 SUMMARY 535
17.8 REFERENCES 536
CHAPTER 18. DIRECT INTERCONNECTION NETWORKS 537
IVAN STOJMENOVIC
18.1 TOPOLOGICAL PROPERTIES OF INTERCONNECTION NETWORKS 537
18.2 HYPERCUBIC NETWORKS 547
18.3 ROUTING AND BROADCASTING 555
18.4 CONCLUSIONS 563
18.5 REFERENCES 564
18.6 SUGGESTED READINGS 565
CHAPTER 19. PARALLEL AND COMMUNICATION ALGORITHMS ON HYPERCUBE
MULTIPROCESSORS 568
AFONSO FERREIRA
19.1 TOPOLOGICAL ASPECTS 569
19.2 COMMUNICATION ISSUES 573
19.3 USEFUL ALGORITHMIC TOOLS 577
19.4 SOLVING PROBLEMS 581
19.5 CONCLUSIONS AND FUTURE DIRECTIONS 587
19.6 REFERENCES 588
PART II ARCHITECTURES AND TECHNOLOGIES
ARCHITECTURES
CHAPTER 20. RISC ARCHITECTURES 595
MANOLIS KATEVENIS
20.1 WHAT IS RISC? 596
20.2 PIPELINING AND BYPASSING 599
IMAGE 8
CONTENTS XIII
20.3 DEPENDENCES AND PARALLELISM IN CISC AND IN RISC 604
20.4 INSTRUCTION ALIGNMENT, SIZE, AND FORMAT 609
20.5 IMPLEMENTATION DISADVANTAGES OF CISC 615
20.6 HISTORY, PERSPECTIVE, AND CONCLUSIONS 617
20.7 REFERENCES 619
CHAPTER 21. SUPERSCALAR AND VLIW PROCESSORS 621
THOMAS M. CONTE
21.1 SUPERSCALAR PROCESSORS 622
21.2 VLIW PROCESSORS 634
21.3 SUPERSCALAR VS. VLIW: WHICH IS BETTER? 645
21.4 BIBLIOGRAPHY 647
CHAPTER 22. SIMD-PROCESSING: CONCEPTS AND SYSTEMS 649
MICHAEL JURCZYK AND THOMAS SCHWEDERSKI
22.1 BASIC CONCEPTS 649
22.2 SIMD MACHINE COMPONENTS 654
22.3 ASSOCIATIVE PROCESSING 660
22.4 CASE STUDIES OF SIMD SYSTEMS 662
22.5 APPLICATIONS AND ALGORITHMS 669
22.6 LANGUAGES AND PROGRAMMING 673
22.7 CONCLUSIONS 677
22.8 REFERENCES 677
CHAPTER 23. MIMD ARCHITECTURES: SHARED AND DISTRIBUTED MEMORY DESIGNS
680
RALPH DUNCAN
23.1 PROLIFERATION OF MIMD DESIGNS 681
23.2 SHARED MEMORY ARCHITECTURES 682
23.3 DISTRIBUTED MEMORY ARCHITECTURES 689
23.4 HYBRID SHARED/DISTRIBUTED MEMORY ARCHITECTURES 695
23.5 CONCLUSION 696
23.6 REFERENCES 697
CHAPTER 24. MEMORY MODELS 699
LEONIDAS I. KONTOTHANASSIS AND MICHAEL L. SCOTT
24.1 MEMORY HARDWARE TECHNOLOGY 700
24.2 MEMORY SYSTEM ARCHITECTURE 702
24.3 USER-LEVEL MEMORY MODELS 707
24.4 MEMORY CONSISTENCY MODELS 711
24.5 IMPLEMENTATION AND PERFORMANCE OF MEMORY CONSISTENCY MODELS 714
24.6 CONCLUSIONS AND TRENDS 718
24.7 REFERENCES 719
IMAGE 9
XIV PARALLEL AND DISTRIBUTED COMPUTING
TECHNOLOGIES
CHAPTER 25. HETEROGENEOUS COMPUTING 725
HOWARD JAY SIEGEL, JOHN K. ANTONIO, RICHARD C. METZGER, MIN TAN, AND YAN
ALEXANDER LI
25.1 INTRODUCTION 725
25.2 MIXED-MODE SYSTEMS 727
25.3 EXAMPLES OF EXISTING MIXED-MACHINE HC SYSTEMS 733
25.4 EXAMPLES OF SOFTWARE TOOLS FOR MIXED-MACHINE HC SYSTEMS 735
25.5 A CONCEPTUAL MODEL FOR AUTOMATIC MIXED-MACHINE HC 739
25.6 TASK PROFILING AND ANALYTICAL BENCHMARKING 741
25.7 MATCHING AND SCHEDULING FOR MIXED-MACHINE HC SYSTEMS 747
25.8 CONCLUSIONS AND FUTURE DIRECTIONS 756
25.9 REFERENCES 758
CHAPTER 26. CLUSTER COMPUTING 762
LOUIS TURCOTTE
26.1 TECHNOLOGICAL EVOLUTION 763
26.2 OVERVIEW OF CLUSTERING 767
26.3 DISTINCT USES OF CLUSTERS 771
26.4 OPEN ISSUES 777
26.5 REFERENCES 779
CHAPTER 27. MASSIVELY PARALLEL PROCESSING WITH OPTICAL INTERCONNECTIONS
780
EUGEN SCHENFELD
27.1 PARALLEL PROCESSING MOTIVATIONS 782
27.2 GENERAL-PURPOSE PARALLEL COMPUTERS 785
27.3 HOW MUCH INTERCONNECTION? 793
27.4 CONSIDERATIONS IN CHOOSING THE INTERCONNECTION TOPOLOGY 795
27.5 OPTICAL COMMUNICATION: FREE-SPACE INTERCONNECTION 796
27.6 CONCLUSIONS AND FUTURE WORK 808
27.7 REFERENCES 808
CHAPTER 28. ATM-BASED PARALLEL AND DISTRIBUTED COMPUTING 811
SALIM HARIRI AND BEI LU
28.1 INTRODUCTION 811
28.2 BROADBAND INTEGRATED SERVICE DATA NETWORK (B-ISDN) 812
28.3 ATM PROTOCOLS 814
28.4 ATM SWITCHES 824
28.5 HOST-TO-NETWORK INTERFACES 831
28.6 PARALLEL AND DISTRIBUTED COMPUTING ENVIRONMENT OVER ATM 835
28.7 CONCLUSIONS AND FUTURE DIRECTIONS 836
28.8 REFERENCES 837
IMAGE 10
CONTENTS XV
PART IM TOOLS AND APPLICATIONS
DEVELOPMENT TOOLS
CHAPTER 29. PARALLEL LANGUAGES 843
R. H. PENOTT
29.1 INTRODUCTION 843
29.2 LANGUAGE CATEGORIES 844
29.3 PROGRAMMING LANGUAGES 846
29.4 SUMMARY 861
29.5 REFERENCES 862
CHAPTER 30. TOOLS FOR PORTABLE HIGH-PERFORMANCE PARALLEL COMPUTING 865
DOREEN Y. CHENG
30.1 INTRODUCTION 865
30.2 CRITERIA FOR EVALUATING PORTABILITY SUPPORT 867
30.3 PORTABLE MESSAGE-PASSING LIBRARIES 871
30.4 LANGUAGE-CENTERED TOOLS 878
30.5 PARALLELIZING COMPILERS AND PREPROCESSORS 886
30.6 CONCLUSION 892
30.7 REFERENCES 893
CHAPTER 31. VISUALIZATION OF PARALLEL AND DISTRIBUTED SYSTEMS 897
MICHAEL T. HEATH
31.1 PERFORMANCE MONITORING 898
31.2 PERFORMANCE VISUALIZATION 899
31.3 EXAMPLE 910
31.4 FUTURE DIRECTIONS 913
31.5 REFERENCES 915
CHAPTER 32. CONSTRUCTING NUMERICAL SOFTWARE LIBRARIES FOR
HIGH-PERFORMANCE
COMPUTER ENVIRONMENTS 917
JACK J. DONGARRA AND DAVID W. WALKER
32.1 INTRODUCTION 917
32.2 THE BLAS AS THE KEY TO PORTABILITY 924
32.3 BLOCK ALGORITHMS AND THEIR DERIVATION 925
32.4 LU FACTORIZATION 930
32.5 DATA DISTRIBUTION 932
32.6 PARALLEL IMPLEMENTATION 935
32.7 OPTIMIZATION, TUNING, AND TRADE-OFFS 941
32.8 CONCLUSIONS AND FUTURE RESEARCH DIRECTIONS 948
32.9 REFERENCES 951
IMAGE 11
XVI PARALLEL AND DISTRIBUTED COMPUTING
CHAPTER 33. TESTING OF DISTRIBUTED PROGRAMS 955
K. C. TAI AND RICHARD H. CARVER
33.1 SYN-SEQUENCES OF DISTRIBUTED PROGRAMS 956
33.2 DEFINITIONS OF CORRECTNESS AND FAULTS FOR DISTRIBUTED PROGRAMS 961
33.3 APPROACHES TO TESTING DISTRIBUTED PROGRAMS 963
33.4 TEST GENERATION FOR DISTRIBUTED PROGRAMS 968
33.5 ANALYSIS AND REPLAY OF PROGRAM EXECUTIONS 973
33.6 BUILDING TESTING TOOLS FOR DISTRIBUTED PROGRAMS 975
33.7 CONCLUSIONS AND FUTURE WORK 976
33.8 REFERENCES 977
APPLICATIONS
CHAPTER 34. SCIENTIFIC COMPUTATION 981
TIMOTHY G. MATTSON
34.1 PROGRAMMING MODELS FOR PARALLEL COMPUTING 982
34.2 ALGORITHMS FOR PARALLEL SCIENTIFIC COMPUTING 983
34.3 CASE STUDIES: MOLECULAR MODELING 989
34.4 TRENDS 997
34.5 FURTHER READING 999
34.6 CONCLUSION 1000
34.7 REFERENCES 1001
CHAPTER 35. PARALLEL AND DISTRIBUTED SIMULATION OF DISCRETE EVENT
SYSTEMS 1003
ALOIS FERSCHA
35.1 SIMULATION PRINCIPLES 1003
35.2 CLASSICAL LP SIMULATION PROTOCOLS 1009
35.3 CONSERVATIVE VS. OPTIMISTIC PROTOCOLS 1037
35.4 CONCLUSIONS AND OUTLOOK 1037
35.5 REFERENCES 1039
CHAPTER 36. PARALLELISM FOR IMAGE UNDERSTANDING 1042
VIKTOR K. PRASANNA AND CHO-LI WANG
36.1 VISION TASKS 1046
36.2 A MODEL OF CM-5 1050
36.3 SCALABLE PARALLEL ALGORITHMS 1051
36.4 IMPLEMENTATION DETAILS AND EXPERIMENTAL RESULTS 1060
36.5 CONCLUDING REMARKS 1068
36.6 REFERENCES 1069
IMAGE 12
CONTENTS XVII
CHAPTER 37. PARALLEL COMPUTATION IN BIOMEDICINE: GENETIC AND PROTEIN
SEQUENCE ANALYSIS 1071
TIENG K. YAP, OPHIR FRIEDER, AND ROBERT L MARTINO
37.1 THE ORIGIN OF GENETIC AND PROTEIN SEQUENCE DATA 1072
37.2 AN EXAMPLE DATABASE: GENBANK 1074
37.3 RESIDUE SUBSTITUTION SCORING MATRICES 1077
37.4 SEQUENCE COMPARISON ALGORITHMS 1080
37.5 PARALLEL TECHNIQUES FOR SEQUENCE SIMILARITY SEARCHING 1083
37.6 PERFORMANCE 1089
37.7 DISCUSSION AND CONCLUSIONS 1093
37.8 FUTUREWORK 1095
37.9 REFERENCES 1095
CHAPTER 38. PARALLEL ALGORITHMS FOR SOLVING STOCHASTIC LINEAR PROGRAMS
1097
AMAL DE SILVA AND DAVID ABRAMSON
38.1 STOCHASTIC LINEAR PROGRAMMING 1098
38.2 TECHNIQUES FOR SOLVING STOCHASTIC LINEAR PROGRAMS 1104
38.3 COMPARISON OF METHODS 1113
38.4 CONCLUSION AND FUTURE DIRECTIONS 1115
38.5 REFERENCES 1115
CHAPTER 39. PARALLEL GENETIC ALGORITHMS 1118
ANDREW CHIPPERFIELD AND PETER FLEMING
39.1 WHAT ARE GENETIC ALGORITHMS? 1118
39.2 MAJOR ELEMENTS OF THE GENETIC ALGORITHM 1121
39.3 PARALLEL GAS 1130
39.4 CONCLUSIONS AND FUTURE TRENDS 1140
39.5 REFERENCES 1141
CHAPTER 40. PARALLEL PROCESSING FOR ROBOTIC COMPUTATIONS: A REVIEW 1144
TAREK M. NABHAN AND ALBERT Y. ZOMAYA
40.1 OVERVIEW OF ROBOTIC SYSTEMS 1144
40.2 THE TASK PLANNER 1145
40.3 SENSING 1147
40.4 ROBOT CONTROL 1149
40.5 APPLICATIONS OF ADVANCED ARCHITECTURES FOR ROBOT KINEMATICS
AND DYNAMICS 1150
40.6 SUMMARY, CONCLUSIONS, AND FUTURE DIRECTIONS 1154
40.7 REFERENCES 1155
IMAGE 13
XVIII PARALLEL AND DISTRIBUTED COMPUTING
CHAPTER 41. DISTRIBUTED FLIGHT SIMULATION: A CHALLENGE FOR SOFTWARE
ARCHITECTURE 1160
RICK KAZMAN
41.1 41.2 41.3 41.4
41.5 41.6 41.7 41.8 41.9
THE CHALLENGE OF DISTRIBUTED FLIGHT SIMULATION A GENERIC FLIGHT
SIMULATOR INTRODUCTION TO SOFTWARE ARCHITECTURE STRUCTURAL MODELING
MOTIVATIONS FOR STRUCTURAL MODELING FLIGHT SIMULATOR SOFTWARE
ARCHITECTURE: OVERVIEW FLIGHT SIMULATOR SOFTWARE ARCHITECTURE: BASE
TYPES A SIMPLIFIED SOFTWARE STRUCTURE REQUIREMENTS OF FLIGHT SIMULATION
41.10 LESSONS LEARNED/FUTURE DIRECTIONS 41.11 41.12
SUMMARY REFERENCES
1160 1162 1164 1166
1167 1168 1169
1173 1173 1176 1176 1176
INDEX 1179
|
| any_adam_object | 1 |
| author_GND | (DE-588)135767342 |
| building | Verbundindex |
| bvnumber | BV010585105 |
| callnumber-first | Q - Science |
| callnumber-label | QA76 |
| callnumber-raw | QA76.58.P3635 1996 |
| callnumber-search | QA76.58.P3635 1996 |
| callnumber-sort | QA 276.58 P3635 41996 |
| callnumber-subject | QA - Mathematics |
| classification_rvk | ST 200 ST 230 |
| classification_tum | DAT 516f DAT 250f |
| ctrlnum | (OCoLC)32820483 (DE-599)BVBBV010585105 |
| dewey-full | 004/.35 004/.3520 |
| dewey-hundreds | 000 - Computer science, information, general works |
| dewey-ones | 004 - Computer science |
| dewey-raw | 004/.35 004/.35 20 |
| dewey-search | 004/.35 004/.35 20 |
| dewey-sort | 14 235 |
| dewey-tens | 000 - Computer science, information, general works |
| discipline | Informatik |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>03130nam a2200841 c 4500</leader><controlfield tag="001">BV010585105</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">19960221 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">960125s1996 xxuad|| |||| 00||| engod</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">0070730202</subfield><subfield code="9">0-07-073020-2</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)32820483</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV010585105</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rakddb</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">XD-US</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-91</subfield><subfield code="a">DE-91G</subfield><subfield code="a">DE-20</subfield><subfield code="a">DE-29T</subfield><subfield code="a">DE-384</subfield><subfield code="a">DE-739</subfield><subfield code="a">DE-521</subfield><subfield code="a">DE-634</subfield><subfield code="a">DE-83</subfield><subfield code="a">DE-11</subfield></datafield><datafield tag="050" ind1=" " ind2="0"><subfield code="a">QA76.58.P3635 1996</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">004/.35</subfield><subfield code="2">20</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">004/.35 20</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="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">DAT 516f</subfield><subfield code="2">stub</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">DAT 250f</subfield><subfield code="2">stub</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Parallel and distributed computing handbook</subfield><subfield code="c">Albert Y. Zomaya, ed.</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">New York [u.a.]</subfield><subfield code="b">McGraw-Hill</subfield><subfield code="c">1996</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">XXX, 1199 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="490" ind1="0" ind2=" "><subfield code="a">Computer engineering series</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">ATM</subfield><subfield code="2">inriac</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Gedistribueerde gegevensverwerking</subfield><subfield code="2">gtt</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">MIND</subfield><subfield code="2">inriac</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">P-RAM</subfield><subfield code="2">inriac</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Parallelle verwerking</subfield><subfield code="2">gtt</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Parallélisme (informatique)</subfield><subfield code="2">ram</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Programmation parallèle (informatique)</subfield><subfield code="2">ram</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Programmation parallèle</subfield><subfield code="2">ram</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">RISC</subfield><subfield code="2">inriac</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">SIMD</subfield><subfield code="2">inriac</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Traitement réparti</subfield><subfield code="2">ram</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">VLIW</subfield><subfield code="2">inriac</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">algorithme génétique</subfield><subfield code="2">inriac</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">algorithme parallèle</subfield><subfield code="2">inriac</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">architecture flot donnée</subfield><subfield code="2">inriac</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">calcul scientifique</subfield><subfield code="2">inriac</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">concurrence</subfield><subfield code="2">inriac</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">graphe parallèle</subfield><subfield code="2">inriac</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">hypercube</subfield><subfield code="2">inriac</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">interconnexion réseau</subfield><subfield code="2">inriac</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">langage parallèle</subfield><subfield code="2">inriac</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">méthode formelle</subfield><subfield code="2">inriac</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">processeur VLSI</subfield><subfield code="2">inriac</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">robotique</subfield><subfield code="2">inriac</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">super-calculateur</subfield><subfield code="2">inriac</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">système ouvert</subfield><subfield code="2">inriac</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">système parallèle</subfield><subfield code="2">inriac</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">système réparti</subfield><subfield code="2">inriac</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">système événement discret</subfield><subfield code="2">inriac</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Datenverarbeitung</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Parallel processing (Electronic computers)</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Electronic data processing -- Distributed processing</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Verteiltes System</subfield><subfield code="0">(DE-588)4238872-7</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=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="1" ind2="0"><subfield code="a">Verteiltes System</subfield><subfield code="0">(DE-588)4238872-7</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Zomaya, Albert Y.</subfield><subfield code="d">1964-</subfield><subfield code="e">Sonstige</subfield><subfield code="0">(DE-588)135767342</subfield><subfield code="4">oth</subfield></datafield><datafield tag="856" ind1="4" ind2=" "><subfield code="u">http://www.loc.gov/catdir/toc/mh022/95032594.html</subfield><subfield code="3">Table of contents</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="m">GBV Datenaustausch</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=007057595&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-007057595</subfield></datafield></record></collection> |
| id | DE-604.BV010585105 |
| illustrated | Illustrated |
| indexdate | 2024-07-09T17:55:28Z |
| institution | BVB |
| isbn | 0070730202 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-007057595 |
| oclc_num | 32820483 |
| open_access_boolean | |
| owner | DE-91 DE-BY-TUM DE-91G DE-BY-TUM DE-20 DE-29T DE-384 DE-739 DE-521 DE-634 DE-83 DE-11 |
| owner_facet | DE-91 DE-BY-TUM DE-91G DE-BY-TUM DE-20 DE-29T DE-384 DE-739 DE-521 DE-634 DE-83 DE-11 |
| physical | XXX, 1199 S. Ill., graph. Darst. |
| publishDate | 1996 |
| publishDateSearch | 1996 |
| publishDateSort | 1996 |
| publisher | McGraw-Hill |
| record_format | marc |
| series2 | Computer engineering series |
| spelling | Parallel and distributed computing handbook Albert Y. Zomaya, ed. New York [u.a.] McGraw-Hill 1996 XXX, 1199 S. Ill., graph. Darst. txt rdacontent n rdamedia nc rdacarrier Computer engineering series ATM inriac Gedistribueerde gegevensverwerking gtt MIND inriac P-RAM inriac Parallelle verwerking gtt Parallélisme (informatique) ram Programmation parallèle (informatique) ram Programmation parallèle ram RISC inriac SIMD inriac Traitement réparti ram VLIW inriac algorithme génétique inriac algorithme parallèle inriac architecture flot donnée inriac calcul scientifique inriac concurrence inriac graphe parallèle inriac hypercube inriac interconnexion réseau inriac langage parallèle inriac méthode formelle inriac processeur VLSI inriac robotique inriac super-calculateur inriac système ouvert inriac système parallèle inriac système réparti inriac système événement discret inriac Datenverarbeitung Parallel processing (Electronic computers) Electronic data processing -- Distributed processing Verteiltes System (DE-588)4238872-7 gnd rswk-swf Parallelverarbeitung (DE-588)4075860-6 gnd rswk-swf Parallelverarbeitung (DE-588)4075860-6 s DE-604 Verteiltes System (DE-588)4238872-7 s Zomaya, Albert Y. 1964- Sonstige (DE-588)135767342 oth http://www.loc.gov/catdir/toc/mh022/95032594.html Table of contents GBV Datenaustausch application/pdf http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=007057595&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA Inhaltsverzeichnis |
| spellingShingle | Parallel and distributed computing handbook ATM inriac Gedistribueerde gegevensverwerking gtt MIND inriac P-RAM inriac Parallelle verwerking gtt Parallélisme (informatique) ram Programmation parallèle (informatique) ram Programmation parallèle ram RISC inriac SIMD inriac Traitement réparti ram VLIW inriac algorithme génétique inriac algorithme parallèle inriac architecture flot donnée inriac calcul scientifique inriac concurrence inriac graphe parallèle inriac hypercube inriac interconnexion réseau inriac langage parallèle inriac méthode formelle inriac processeur VLSI inriac robotique inriac super-calculateur inriac système ouvert inriac système parallèle inriac système réparti inriac système événement discret inriac Datenverarbeitung Parallel processing (Electronic computers) Electronic data processing -- Distributed processing Verteiltes System (DE-588)4238872-7 gnd Parallelverarbeitung (DE-588)4075860-6 gnd |
| subject_GND | (DE-588)4238872-7 (DE-588)4075860-6 |
| title | Parallel and distributed computing handbook |
| title_auth | Parallel and distributed computing handbook |
| title_exact_search | Parallel and distributed computing handbook |
| title_full | Parallel and distributed computing handbook Albert Y. Zomaya, ed. |
| title_fullStr | Parallel and distributed computing handbook Albert Y. Zomaya, ed. |
| title_full_unstemmed | Parallel and distributed computing handbook Albert Y. Zomaya, ed. |
| title_short | Parallel and distributed computing handbook |
| title_sort | parallel and distributed computing handbook |
| topic | ATM inriac Gedistribueerde gegevensverwerking gtt MIND inriac P-RAM inriac Parallelle verwerking gtt Parallélisme (informatique) ram Programmation parallèle (informatique) ram Programmation parallèle ram RISC inriac SIMD inriac Traitement réparti ram VLIW inriac algorithme génétique inriac algorithme parallèle inriac architecture flot donnée inriac calcul scientifique inriac concurrence inriac graphe parallèle inriac hypercube inriac interconnexion réseau inriac langage parallèle inriac méthode formelle inriac processeur VLSI inriac robotique inriac super-calculateur inriac système ouvert inriac système parallèle inriac système réparti inriac système événement discret inriac Datenverarbeitung Parallel processing (Electronic computers) Electronic data processing -- Distributed processing Verteiltes System (DE-588)4238872-7 gnd Parallelverarbeitung (DE-588)4075860-6 gnd |
| topic_facet | ATM Gedistribueerde gegevensverwerking MIND P-RAM Parallelle verwerking Parallélisme (informatique) Programmation parallèle (informatique) Programmation parallèle RISC SIMD Traitement réparti VLIW algorithme génétique algorithme parallèle architecture flot donnée calcul scientifique concurrence graphe parallèle hypercube interconnexion réseau langage parallèle méthode formelle processeur VLSI robotique super-calculateur système ouvert système parallèle système réparti système événement discret Datenverarbeitung Parallel processing (Electronic computers) Electronic data processing -- Distributed processing Verteiltes System Parallelverarbeitung |
| url | http://www.loc.gov/catdir/toc/mh022/95032594.html http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=007057595&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |
| work_keys_str_mv | AT zomayaalberty parallelanddistributedcomputinghandbook |