Next: Hierarchical Method
Up: Parallel Cluster Algorithms
Previous: Parallel Labeling for
Cluster labeling can be looked on as a special case of an equivalence
problem: given a list of equivalences (site 
site j), put all
the elements into equivalence classes (cluster labels). There are many
algorithms known for solving this problem.
Parallel implementation:
- Label sub-clusters sequentially for sublattice on each node.
- Each processor looks at the edges of its neighbors and creates a list
of equivalences.
- Lists are sent to one of the nodes,
which creates the global equivalence classes
and returns the results to all nodes.
Paul Coddington, Northeast Parallel Architectures Center at Syracuse University, paulc@npac.syr.edu