Parallel simulation of the Ising model
G. T. Barkema, T. MacFarland
Abstract
G. T. Barkema, T. MacFarland
Abstract
Methods for parallelizing Ising model simulations are presented. A parallel single-spin Metropolis algorithm [J. Chem. Phys. 21, 1087 (1953)] has been implemented with a speedup of 27 on 50 processors of the KSR-1 parallel computer. A parallel Swendsen-Wang algorithm [Phys. Rev. Lett. 58, 86 (1987)] obtains a speedup of 3.2 on nine processors of the same computer. Both of these simulations were carried out by 200\ifmmode\times\else\texttimes\fi{}200 lattices. The parallel local cluster algorithm [Phys. Rev. Lett. 71, 2070 (1993)] has been implemented with an almost linear speedup. We also discuss ongoing research using the parallel local cluster algorithm.
OpenAlex reports 38 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
Methods for parallelizing Ising model simulations are presented. A parallel single-spin Metropolis algorithm [J. Chem. Phys. 21, 1087 (1953)] has been implemented with a speedup of 27 on 50 processors of the KSR-1 parallel computer. A parallel Swendsen-Wang algorithm [Phys. Rev. Lett. 58, 86 (1987)] obtains a speedup of 3.2 on nine processors of the same computer. Both of these simulations were carried out by 200\ifmmode\times\else\texttimes\fi{}200 lattices. The parallel local cluster algorithm [Phys. Rev. Lett. 71, 2070 (1993)] has been implemented with an almost linear speedup. We also discuss ongoing research using the parallel local cluster algorithm.
Key concepts: Speedup, Ising model, Computer science, Parallel algorithm, Cluster (spacecraft), Parallel computing, Statistical physics, Computational science