Search and Find
Service
Parallel Processing from Applications to Systems
of: Dan I. Moldovan
Elsevier Reference Monographs, 2014
ISBN: 9781483297514 , 567 Pages
Format: PDF
Copy protection: DRM
Front Cover
1
Parallel Processing: From Applications to Systems
4
Copyright Page
5
Table of Contents
8
PREFACE
14
CHAPTER 1. INTRODUCTION
20
1.1 PARALLELISM AS A CONCEPT
21
1.2 APPLICATIONS OF PARALLEL PROCESSING
34
1.3 RELATION BETWEEN PARALLEL ALGORITHMS AND ARCHITECTURES
41
1.4 PERFORMANCE OF PARALLEL COMPUTATIONS
45
1.5 MAIN ISSUES FOR FUTURE RESEARCH IN PARALLEL PROCESSING
57
1.6 BIBLIOGRAPHICAL NOTES AND FURTHER READING
66
1.7 PROBLEMS
67
CHAPTER 2. ANALYSIS OF PARALLELISM IN COMPUTER ALGORITHMS
76
2.1 DATA AND CONTROL DEPENDENCIES
77
2.2 PARALLEL NUMERICAL ALGORITHMS
86
2.3 PARALLEL NON-NUMERICAL ALGORITHMS
109
2.4 BIBLIOGRAPHICAL NOTES AND FURTHER READING
133
2.5 PROBLEMS
134
CHAPTER 3. PROGRAM TRANSFORMATIONS
146
3.1 REMOVAL OF OUTPUT DEPENDENCIES AND ANTIDEPENDENCIES
147
3.2 PROGRAMS WITH LOOPS
151
3.3 TRANSFORMATION OF INDEX SETS AND DEPENDENCIES
168
3.4 OPTIMAL TIME TRANSFORMATIONS
175
3.5 NONLINEAR TRANSFORMATIONS
178
3.6 BIBLIOGRAPHICAL NOTES AND FURTHER READING
182
3.7 PROBLEMS
183
CHAPTER 4. ARRAY PROCESSORS
200
4.1 SINGLE-INSTRUCTION MULTIPLE-DATA (SIMD) COMPUTERS
201
4.2 INTERCONNECTION NETWORKS FOR SIMD COMPUTERS
210
4.3 SIMD SUPERCOMPUTERS
223
4.4 SYSTOLIC ARRAY PROCESSORS
236
4.5 ASSOCIATIVE PROCESSING
246
4.6 BIBLIOGRAPHICAL NOTES AND FURTHER READING
258
4.7 PROBLEMS
258
CHAPTER 5. MAPPING ALGORITHMS INTO ARRAY PROCESSORS
268
5.1 MAPPING OF ALGORITHMS INTO SYSTOLIC ARRAYS
269
5.2 ALGORITHM PARTITIONING FOR FIXED-SIZE SYSTOLIC ARRAYS
279
5.3 MAPPING OF ALGORITHMS INTO SIMD PROCESSORS
291
5.4 MAPPING OF ALGORITHMS INTO MESH-CONNECTED NETWORKS
306
5.5 BIBLIOGRAPHICAL NOTES AND FURTHER READING
314
5.6 PROBLEMS
315
CHAPTER 6. MULTIPROCESSOR SYSTEMS
340
6.1 MULTIPROCESSOR ORGANIZATION AND OPERATING PRINCIPLES
340
6.2 MULTIPROCESSOR INTERCONNECTION NETWORKS AND MEMORIES
349
6.3 MAPPING ALGORITHMS INTO MULTIPROCESSORS
363
6.4 OPERATING SYSTEMS FOR MULTIPROCESSORS
377
6.5 THE CEDAR MULTIPROCESSOR
392
6.6 HYPERCUBE COMPUTERS
395
6.7 BIBLIOGRAPHICAL NOTES AND FURTHER READING
401
6.8 PROBLEMS
403
CHAPTER 7. DATA-FLOW COMPUTING
418
7.1 DATA-AND DEMAND-DRIVEN MODELS OF COMPUTATION
418
7.2 STATIC DATA-FLOW COMPUTERS
429
7.3 DYNAMIC DATA-FLOW COMPUTERS
432
7.4 COMBINING DATA FLOW AND CONTROL FLOW
438
7.5 BIBLIOGRAPHICAL NOTES AND FURTHER READING
440
7.6 PROBLEMS
440
CHAPTER 8. PARALLEL PROCESSING OF RULE-BASED SYSTEMS AND SEMANTIC NETWORKS
448
8.1 PARALLELISM ANALYSIS IN RULE-BASED SYSTEMS
449
8.2 MULTIPLE-RULE FIRING
465
8.3 KNOWLEDGE REPRESENTATION AND REASONING USING SEMANTIC NETWORKS
481
8.4 PARALLEL NATURAL LANGUAGE PROCESSING
494
8.5 SEMANTIC NETWORK ARRAY PROCESSOR
503
8.6 BIBLIOGRAPHICAL NOTES AND FURTHER READING
522
8.7 PROBLEMS
523
BIBLIOGRAPHY
542
INDEX
556
All prices incl. VAT