Efficient space virtualization for the Hoshen–Kopelman algorithm

Abstract

In this paper, the efficient space virtualisation for the Hoshen–Kopelman algorithm is presented. We observe minimal parallel overhead during computations, due to negligible communication costs. The proposed algorithm is applied for computation of random-site percolation thresholds for four dimensional simple cubic lattice with sites’ neighborhoods containing next–next–nearest neighbors (3NN). The obtained percolation thresholds are [Formula: see text], [Formula: see text], [Formula: see text], [Formula: see text], [Formula: see text], [Formula: see text], [Formula: see text], where 2NN and NN stand for next–nearest neighbors and nearest neighbors, respectively.