pith. sign in

arxiv: 1110.0899 · v2 · pith:N5XWHGIMnew · submitted 2011-10-05 · ⚛️ physics.comp-ph

GPU-based single-cluster algorithm for the simulation of the Ising model

classification ⚛️ physics.comp-ph
keywords calculationalgorithmisingmodelspeedsingle-clustersynchronizationcluster
0
0 comments X
read the original 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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.