PARALLEL CLUSTER LABELING FOR LARGE-SCALE MONTE-CARLO SIMULATIONS

We present an optimized version of a cluster labeling algorithm previously introduced by the authors. This algorithm is well suited for large-scale Monte Carlo simulations of spin models using cluster dynamics on parallel computers with large numbers of processors. The algorithm divides physical space into rectangular cells which are assigned to processors and combines a serial local labeling procedure with a relaxation process across nearest-neighbor processors. By controling overhead and reducing inter-processor communication this method attains good computational speed-up and efficiency. Large systems of up to 65536(2) spins have been simulated at updating speeds of 11 nanosecs/site (90.7 x 10(6) spin updates/sec) using state-of-the-art supercomputers. In the second part of the article we use the cluster algorithm to study the relaxation of magnetization and energy on large Ising models using Swendsen-Wang dynamics. We found evidence that exponential and power law factors are present in the relaxation process as has been proposed by Hackl et al. The variation of the power-law exponent lambda(M) taken at face value indicates that the value of z(M) falls in the interval 0.31-0.49 for the time interval analysed and appears to vanish asymptotically.