Affiliation:
1. Faculty of Physics and Applied Computer Science, AGH University of Science and Technology, al. Mickiewicza 30 30-059 Krakow, Poland
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.
Publisher
World Scientific Pub Co Pte Lt
Subject
Computational Theory and Mathematics,Computer Science Applications,General Physics and Astronomy,Mathematical Physics,Statistical and Nonlinear Physics
Cited by
21 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献