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

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.

Saved in:
Bibliographic Details
Published in:Computer physics communications Vol. 130; no. 1; pp. 118 - 129
Main Authors: Teuler, J.M., Gimel, J.C.
Format: Journal Article
Language:English
Published: Amsterdam Elsevier B.V 01.07.2000
Elsevier Science
Elsevier
Subjects:
Atomic and molecular physics
Calculations and mathematical techniques in atomic and molecular physics (excluding electron correlation calculations)
Computational techniques
Computer Science
Coupled cluster theory
Data Structures and Algorithms
Electronic structure of atoms, molecules and their ions: theory
Exact sciences and technology
Mathematical methods in physics
Parallel computing
Percolation
Physics
Statistical model calculations (including Thomas-Fermi and Thomas-Fermi-Dirac models)
Percolation
Parallel computing
Performance evaluation
Distributed memory
Cubic lattices
Percolation clusters
Algorithms
Theoretical study
Percolation theory
Parallel computation
Calculation methods
ISSN:0010-4655, 1879-2944
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
ISSN:0010-4655
1879-2944
DOI:10.1016/S0010-4655(00)00046-1