Parallel simulation of the Ising model
Authors:
- 1 August 1994
- journal article
- research article
- Published by American Physical Society (APS) in Physical Review E
- Vol. 50 (2) , 1623-1628
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×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.Keywords
This publication has 13 references indexed in Scilit:
- Accelerating diffusive nonequilibrium processes in discrete spin systemsPhysical Review Letters, 1993
- A fast vectorized Fortran 77 program for the Monte Carlo simulation of the three-dimensional Ising systemComputer Physics Communications, 1990
- A parallel processor for the simulation of Ising spin systemsComputer Physics Communications, 1989
- Monte Carlo simulation of domain growth in the kinetic Ising model on the connection machineComputer Physics Communications, 1989
- OPTIMIZATION OF THE FORTRAN CODE FOR THE THREE-DIMENSIONAL ISING MODEL ON THE M64/60International Journal of High Speed Computing, 1989
- A fast vectorized multispin coding algorithm for 3D Monte Carlo simulations using Kawasaki spin-exchange dynamicsJournal of Statistical Physics, 1989
- Collective Monte Carlo Updating for Spin SystemsPhysical Review Letters, 1989
- Maximum-length sequences, cellular automata, and random numbersJournal of Computational Physics, 1987
- Nonuniversal critical dynamics in Monte Carlo simulationsPhysical Review Letters, 1987
- Equation of State Calculations by Fast Computing MachinesThe Journal of Chemical Physics, 1953