Preface |
|
x | |
|
A Pattern Language for Parallel Programming |
|
|
1 | (6) |
|
|
1 | (2) |
|
|
3 | (1) |
|
Design Patterns and Pattern Languages |
|
|
4 | (1) |
|
A Pattern Language for Parallel Programming |
|
|
5 | (2) |
|
Background and Jargon of Parallel Computing |
|
|
7 | (17) |
|
Concurrency in Parallel Programs Versus Operating Systems |
|
|
7 | (1) |
|
Parallel Architectures: A Brief Introduction |
|
|
8 | (4) |
|
|
8 | (1) |
|
A Further Breakdown of MIMD |
|
|
9 | (3) |
|
|
12 | (1) |
|
Parallel Programming Environments |
|
|
12 | (4) |
|
The Jargon of Parallel Computing |
|
|
16 | (2) |
|
A Quantitative Look at Parallel Computation |
|
|
18 | (3) |
|
|
21 | (2) |
|
|
21 | (1) |
|
Overlapping Communication and Computation and Latency Hiding |
|
|
22 | (1) |
|
|
23 | (1) |
|
The Finding Concurrency Design Space |
|
|
24 | (33) |
|
|
24 | (5) |
|
|
25 | (1) |
|
Using the Decomposition Patterns |
|
|
26 | (1) |
|
|
26 | (3) |
|
The Task Decomposition Pattern |
|
|
29 | (5) |
|
The Data Decomposition Pattern |
|
|
34 | (5) |
|
|
39 | (3) |
|
|
42 | (2) |
|
|
44 | (5) |
|
The Design Evaluation Pattern |
|
|
49 | (6) |
|
|
55 | (2) |
|
The Algorithm Structure Design Space |
|
|
57 | (64) |
|
|
57 | (2) |
|
Choosing an Algorithm Structure Pattern |
|
|
59 | (3) |
|
|
59 | (1) |
|
Major Organizing Principle |
|
|
60 | (1) |
|
The Algorithm Structure Decision Tree |
|
|
60 | (2) |
|
|
62 | (1) |
|
|
62 | (2) |
|
|
62 | (1) |
|
|
63 | (1) |
|
The Task Parallelism Pattern |
|
|
64 | (9) |
|
The Divide and Conquer Pattern |
|
|
73 | (6) |
|
The Geometric Decomposition Pattern |
|
|
79 | (18) |
|
The Recursive Data Pattern |
|
|
97 | (6) |
|
|
103 | (11) |
|
The Event-Based Coordination Pattern |
|
|
114 | (7) |
|
The Supporting Structures Design Space |
|
|
121 | (95) |
|
|
121 | (2) |
|
Program Structuring Patterns |
|
|
122 | (1) |
|
Patterns Representing Data Structures |
|
|
123 | (1) |
|
|
123 | (2) |
|
|
125 | (1) |
|
|
126 | (17) |
|
The Master/Worker Pattern |
|
|
143 | (9) |
|
The Loop Parallelism Pattern |
|
|
152 | (15) |
|
|
167 | (6) |
|
|
173 | (10) |
|
|
183 | (15) |
|
The Distributed Array Pattern |
|
|
198 | (13) |
|
Other Supporting Structures |
|
|
211 | (5) |
|
|
211 | (1) |
|
|
212 | (2) |
|
|
214 | (1) |
|
Concurrent Programming with Declarative Languages |
|
|
214 | (1) |
|
Problem-Solving Environments |
|
|
215 | (1) |
|
The Implementation Mechanisms Design Space |
|
|
216 | (37) |
|
|
217 | (1) |
|
|
217 | (4) |
|
Thread Creation/Destruction |
|
|
218 | (2) |
|
Process Creation/Destruction |
|
|
220 | (1) |
|
|
221 | (16) |
|
Memory Synchronization and Fences |
|
|
221 | (5) |
|
|
226 | (3) |
|
|
229 | (8) |
|
|
237 | (16) |
|
|
238 | (7) |
|
|
245 | (6) |
|
Other Communication Constructs |
|
|
251 | (2) |
|
Appendix A A Brief Introduction to OpenMP |
|
|
253 | (20) |
|
|
254 | (3) |
|
Structured Blocks and Directive Formats |
|
|
257 | (2) |
|
|
259 | (3) |
|
|
262 | (3) |
|
The OpenMP Runtime Library |
|
|
265 | (1) |
|
|
266 | (4) |
|
|
270 | (2) |
|
|
272 | (1) |
|
Appendix B A Brief Introduction to MPI |
|
|
273 | (18) |
|
|
273 | (2) |
|
|
275 | (2) |
|
Basic Point-to-Point Message Passing |
|
|
277 | (2) |
|
|
279 | (4) |
|
Advanced Point-to-Point Message Passing |
|
|
283 | (5) |
|
|
288 | (2) |
|
|
290 | (1) |
|
Appendix C A Brief Introduction to Concurrent Programming in Java |
|
|
291 | (16) |
|
|
293 | (4) |
|
Atomicity, Memory Synchronization, and the volatile Keyword |
|
|
297 | (1) |
|
|
297 | (2) |
|
|
299 | (2) |
|
|
301 | (2) |
|
Other Synchronization Mechanisms and Shared Data Structures |
|
|
303 | (1) |
|
|
304 | (3) |
Glossary |
|
307 | (10) |
Bibliography |
|
317 | (16) |
About the Authors |
|
333 | (2) |
Index |
|
335 | |