|
|
1 | (73) |
|
1.1 Parallel computing is everywhere |
|
|
1 | (1) |
|
|
2 | (7) |
|
1.3 BSP algorithm for inner product computation |
|
|
9 | (4) |
|
1.4 Starting with BSPlib: example program bspinprod |
|
|
13 | (11) |
|
|
24 | (3) |
|
1.6 Example program bspbench |
|
|
27 | (5) |
|
|
32 | (6) |
|
|
38 | (6) |
|
1.9 Example function bspsort |
|
|
44 | (9) |
|
1.10 Experimental results for samplesort on a Cartesius node |
|
|
53 | (4) |
|
|
57 | (12) |
|
1.11.1 BSP-related models of parallel computation |
|
|
57 | (1) |
|
|
58 | (4) |
|
1.11.3 The non-BSP world: message passing and threads |
|
|
62 | (4) |
|
|
66 | (1) |
|
|
67 | (2) |
|
|
69 | (5) |
|
|
74 | (60) |
|
|
74 | (1) |
|
2.2 Sequential LU decomposition |
|
|
75 | (7) |
|
2.3 Basic parallel algorithm |
|
|
82 | (7) |
|
2.4 Two-phase broadcasting and other improvements |
|
|
89 | (7) |
|
2.5 High-performance LU decomposition |
|
|
96 | (4) |
|
2.6 Example function bsplu |
|
|
100 | (13) |
|
2.7 Experimental results on the Cori supercomputer |
|
|
113 | (6) |
|
|
119 | (3) |
|
2.8.1 Matrix distributions |
|
|
119 | (1) |
|
2.8.2 Collective communication |
|
|
120 | (1) |
|
2.8.3 Parallel matrix computations |
|
|
121 | (1) |
|
|
122 | (12) |
|
3 The fast Fourier transform |
|
|
134 | (56) |
|
|
134 | (2) |
|
3.2 Sequential recursive fast Fourier transform |
|
|
136 | (3) |
|
3.3 Sequential nonrecursive algorithm |
|
|
139 | (9) |
|
|
148 | (7) |
|
|
155 | (3) |
|
3.6 Example function bspf ft |
|
|
158 | (8) |
|
3.7 Experimental results on the Cartesius supercomputer |
|
|
166 | (7) |
|
|
173 | (7) |
|
3.8.1 Sequential FFT algorithms |
|
|
173 | (3) |
|
3.8.2 Parallel FFT algorithms |
|
|
176 | (3) |
|
|
179 | (1) |
|
|
180 | (10) |
|
4 Sparse matrix-vector multiplication |
|
|
190 | (101) |
|
|
190 | (5) |
|
4.2 Sparse matrices and their data structures |
|
|
195 | (6) |
|
|
201 | (7) |
|
4.4 Cartesian matrix distribution |
|
|
208 | (7) |
|
4.5 Mondriaan distribution for general sparse matrices |
|
|
215 | (10) |
|
4.6 Fine-grain and medium-grain matrix distribution |
|
|
225 | (6) |
|
|
231 | (6) |
|
4.8 Random sparse matrices |
|
|
237 | (7) |
|
|
244 | (11) |
|
4.10 Parallel algorithm for hybrid-BSP |
|
|
255 | (6) |
|
4.11 Example function bspmv |
|
|
261 | (8) |
|
4.12 Experimental results on the Cartesius supercomputer |
|
|
269 | (6) |
|
|
275 | (8) |
|
4.13.1 Sparse matrix computations |
|
|
275 | (2) |
|
4.13.2 Parallel sparse matrix-vector multiplication algorithms |
|
|
277 | (2) |
|
4.13.3 Partitioning methods |
|
|
279 | (4) |
|
|
283 | (8) |
|
|
291 | (68) |
|
|
291 | (2) |
|
|
293 | (5) |
|
|
298 | (7) |
|
|
305 | (5) |
|
|
310 | (4) |
|
|
314 | (2) |
|
|
316 | (2) |
|
|
318 | (7) |
|
5.9 Example function bspmatch |
|
|
325 | (15) |
|
5.10 Experimental results on the Cartesius supercomputer |
|
|
340 | (6) |
|
|
346 | (5) |
|
5.11.1 Sequential graph matching |
|
|
346 | (2) |
|
5.11.2 Parallel graph matching |
|
|
348 | (1) |
|
|
349 | (2) |
|
|
351 | (8) |
Appendix A Auxiliary BSPedupack functions |
|
359 | (4) |
|
A.1 Header file bspedupack. h |
|
|
359 | (1) |
|
A.2 Utility file bspedupack c |
|
|
360 | (3) |
Appendix B A quick reference guide to BSPlib |
|
363 | (2) |
References |
|
365 | (18) |
Index |
|
383 | |