Efficient space virtualisation for Hoshen--Kopelman algorithm
نویسندگان
چکیده
In this paper the efficient space virtualisation for 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’ neighbourhoods containing next-next-nearest neighbours (3NN). The obtained percolation thresholds are pC(NN) = 0.19680(23), pC(2NN) = 0.08410(23), pC(3NN) = 0.04540(23), pC(2NN+NN) = 0.06180(23), pC(3NN+NN) = 0.04000(23), pC(3NN+2NN) = 0.03310(23), pC(3NN+2NN+NN) = 0.03190(23), where 2NN and NN stand for next-nearest neighbours and nearest neighbours, respectively.
منابع مشابه
A Finite State Machine Approach to Cluster Identification Using the Hoshen-Kopelman Algorithm
The purpose of this study was to develop an efficient finite state machine implementation of the eponymous Hoshen-Kopelman cluster identification algorithm using the nearest-eight neighborhood rule suitable to applications such as computer modeling for landscape ecology. The implementation presented in this study was tested using both actual land cover maps, as well as randomly generated data s...
متن کاملAn Adaptation of the Hoshen-kopelman Cluster Counting Algorithm for Honeycomb Networks
We develop a simplified implementation of the Hoshen-Kopelman cluster counting algorithm adapted for honeycomb networks. In our implementation of the algorithm we assume that all nodes in the network are occupied and links between nodes can be intact or broken. The algorithm counts how many clusters there are in the network and determines which nodes belong to each cluster. The network informat...
متن کاملParallelization of the Hoshen-Kopelman Algorithm Using a Finite State Machine
In applications such as landscape ecology, computermodeling is used to assess habitat fragmentation and its ecological implications. Maps (2-D grids) of habitat clusters or patches are analyzed to determine the number, location, and sizes of clusters. Recently, improved sequential and parallel implementations of theHoshen-Kopelman cluster identification algorithmhave beendesigned. These impleme...
متن کاملParallelised Hoshen-Kopelman algorithm for lattice-Boltzmann simulations
We discuss two topics that we have encountered in our lattice-Boltzmann simulations of complex fluids: the sizes of droplets in particle-stabilised emulsions and deformable particles in fluid flow. The common factor in these seemingly disparate subjects is that both represent an opportunity for a novel application of the Hoshen–Kopelman algorithm. This algorithm is based on detecting connected ...
متن کاملIncipient Spanning Clusters in Square and Cubic Percolation
The analysis of extensive numerical data for the percolation probabilities of incipient spanning clusters in two dimensional percolation at criticality are presented. We developed an effective code for the single-scan version of the Hoshen-Kopelman algorithm. We measured the probabilities on the square lattice forming samples of rectangular strips with widths from 8 to 256 sites and lengths up ...
متن کامل