Studies in Computational Science: Parallel Programming Paradigms
Per Brinch Hansen · 1995
(NOTE: Each chapter begins with an introduction and concludes with Final Remarks. Some chapters include an Appendix after Final Remarks.) I. Programming Concepts. 1. Parallel Programming Paradigms. 2. The SuperPascal Language. II. The All-Pairs Paradigm. 3. Householder Reduction. 4. The All-Pairs Pipeline. 5. Balancing a Pipeline. 6. The N-Body Pipeline. III. The Multiplication Paradigm. 7. The Multiplication Pipeline. IV. The Divide and Conquer Paradigm. 8. The Fast Fourier Transform. 9. Parallel Divide and Conquer. 10. Hypercubes and Tree Machines. V. ThheMonte Carlo Paradigm. 11. Simulated Annealing. 12. Primality Testing. 13. Multiple-Length Division Revisited. 14. Parallel Monte Carlo Trails. VI. The Cellular Automata Paradigm. 15. Laplaces Equation. 16. Parallel Cellular Automata. VII. Parallel Model Programs. 17. Complete SuperPascal Programs. Bibliography.