Next: Multigrid Algorithm
Up: Parallel Cluster Algorithms
Previous: Global Equivalencing
Problems with global equivalencing:
- Equivalence step is a sequential bottleneck
- One node needs enough memory for all cluster labels
These problems are alleviated by hierarchically merging the labels,
using a quad-tree approach as shown below.
Takes 
steps rather than P. More complicated to implement,
a number of optimizations are required to get good performance.
\
\
\
Paul Coddington, Northeast Parallel Architectures Center at Syracuse University, paulc@npac.syr.edu