NPAC Technical Report SCCS-103
A Multi-Grid Cluster Labeling Scheme
J Apostolakis, P Coddington, E Marinari
Submitted June 6 1991
Abstract
We introduce a simple multi-scale algorithm for connected component labeling
on parallel computers, which we apply to the problem of labeling clusters
in spin and percolation models.
We show that it is only logarithmically slowed down in the critical limit
of bond percolation and the Ising model.
We also discuss, in light of the proposed Teraflop computers optimized for
lattice gauge theories and other lattice problems,
the minimum requirements for simple computer switchboard architectures for
which one can efficiently implement
multi-scale algorithms to fight critical slowing down.