A direct parallel implementation of the Hoshen–Kopelman algorithm for distributed memory architectures Original Research Article

We present a direct (i.e. non iterative) method for identifying the clusters of a cubic lattice on a distributed memory parallel machine. We describe the various cluster properties which we were able to compute with this method. Finally, we give some performance measurements.