Next:
Parallel Cluster Algorithms
Up:
CPS 713 Monte Carlo
Previous:
Relation to PDE
Parallel Cluster Algorithms
Parallel Cluster Algorithms
The Need for a Parallel Algorithm
Regular and Local vs. Irregular and Non-Local
Labeling or Growing a Single Cluster
Depth-First Search (``Ants-in-the-Labyrinth'')
Breadth-First Search (FGHK)
Local Label Propagation
SIMD Local Propagation
MIMD Local Propagation
Parallel Labeling for Image Processing
Global Equivalencing
Hierarchical Method
Multigrid Algorithm
Get/Send Algorithm (Shiloach-Vishkin)
Get/Send Algorithm (cont.)
Parallel Wolff Algorithm
Problems with Parallel Ants
Parallel Ants With Cyclic Data Distribution
Independent Parallelism
Independent Monte Carlo Simulations
``Hybrid'' Parallelism
Message Passing vs Data Parallel
Irregular Problems in HPF
Paul Coddington,
Northeast Parallel Architectures Center
at Syracuse University, paulc@npac.syr.edu