论文信息 - Efficient parallelization of the 2D Swendsen-Wang algorithm

Efficient parallelization of the 2D Swendsen-Wang algorithm

We established a fast Swendsen-Wang algorithm for the two-dimensional Ising model on parallel computers with a high efficiency. On an Intel paragon with 140 processors we reached spin update times of only 14 ns with an efficiency of 89%. This algorithm was used to examine the non-equilibrium relaxation of magnetization and energy in large Ising systems of a size up to 17920 × 17920 spins. Nevertheless we observed still a strong finite-size effect for the magnetization. We assume both magnetization and energy decay to behave like (t + Δ)-λe-bt in an infinitely large system. Thus, for long times magnetization and energy show an exponential, asymtotic time-dependence, implying a critical dynamic exponent z of zero.

J. M. Singer | Ingo Morgenstern | Thomas Husslein | Hans-Georg Matuttis | R. Hackl

[1] Dietrich Stauffer,et al. SWENDSEN-WANG DYNAMICS ON LARGE 2D CRITICAL ISING MODELS , 1992 .

[2] R. Hackl,et al. PARALLELIZATION OF THE 2D SWENDSEN–WANG ALGORITHM , 1993 .

[3] Pablo Tamayo,et al. a Parallel Cluster Labeling Method for Monte Carlo Dynamics , 1992 .

[4] Nobuyasu Ito,et al. Non-equilibrium critical relaxation of the Wolff dynamics of the Ising model , 1993 .

[5] Anthony N. Burkitt,et al. Parallel algorithms in computational science , 1991, Springer series in information sciences.

[6] Pablo Tamayo. Magnetization relaxation to equilibrium on large 2D Swendsen-Wang Ising models , 1993 .

[7] D. Heermann,et al. The dynamical critical exponent of the two-, three- and five-dimensional kinetic Ising model , 1993 .

[8] Wang,et al. Nonuniversal critical dynamics in Monte Carlo simulations. , 1987, Physical review letters.

[9] Phase transitions and equilibrium dynamics in strongly random Ising spin systems , 1987 .