Chapter 9
Parallel Algorithms
Abstract
Given a specific algorithm or numerical method, there are several ways to express it in parallel computation. The choice of way will almost certainly be influenced by the hardware architecture present in the supercomputer, as well as how the community has addressed similar problems in the past. This chapter gives an overview of several parallel algorithms widely used in the scientific computing community, including fork–join, divide and conquer, halo exchange, permutation, embarrassingly parallel, manager–worker, and task dataflow.
Keywords
Distributed memory parallelism; Divide and conquer; Embarrassingly parallel; Fork–join; Halo exchange; Manager–worker; Parallel algorithm; Permutation; Seven dwarfs (motifs); ...
Get High Performance Computing now with the O’Reilly learning platform.
O’Reilly members experience books, live events, courses curated by job role, and more from O’Reilly and nearly 200 top publishers.
