GPU-based single-cluster algorithm for the simulation of the Ising model
arXiv:1110.0899 · doi:10.1016/j.jcp.2011.09.029
Abstract
We present the GPU calculation with the common unified device architecture (CUDA) for the Wolff single-cluster algorithm of the Ising model. Proposing an algorithm for a quasi-block synchronization, we realize the Wolff single-cluster Monte Carlo simulation with CUDA. We perform parallel computations for the newly added spins in the growing cluster. As a result, the GPU calculation speed for the two-dimensional Ising model at the critical temperature with the linear size L=4096 is 5.60 times as fast as the calculation speed on a current CPU core. For the three-dimensional Ising model with the linear size L=256, the GPU calculation speed is 7.90 times as fast as the CPU calculation speed. The idea of quasi-block synchronization can be used not only in the cluster algorithm but also in many fields where the synchronization of all threads is required.
References in corpus (1)
Cited by in corpus (8)
- GPU-based Swendsen-Wang multi-cluster algorithm for the simulation of two-dimensional classical spin systems
- CUDA programs for GPU computing of Swendsen-Wang multi-cluster spin flip algorithm: 2D and 3D Ising, Potts, and XY models
- Adaptive Multi-GPU Exchange Monte Carlo for the 3D Random Field Ising Model
- Multi-GPU-based Swendsen-Wang multi-cluster algorithm for the simulation of two-dimensional q-state Potts model
- GPU implementation of the Rosenbluth generation method for static Monte Carlo simulations
- Parallelization and implementation of multi-spin Monte Carlo simulation of 2D square Ising model using MPI and C++
- A differentiable programming framework for spin models
- GPU Computing in Bayesian Inference of Realized Stochastic Volatility Model