2014
DOI: 10.1016/j.cpc.2013.10.029
|View full text |Cite
|
Sign up to set email alerts
|

CUDA programs for the GPU computing of the Swendsen–Wang multi-cluster spin flip algorithm: 2D and 3D Ising, Potts, and XY models

Abstract: We present sample CUDA programs for the GPU computing of the SwendsenWang multi-cluster spin flip algorithm. We deal with the classical spin models; the Ising model, the q-state Potts model, and the classical XY model. As for the lattice, both the 2D (square) lattice and the 3D (simple cubic) lattice are treated. We already reported the idea of the GPU implementation for 2D models [Comput. Phys. Commun. 183 (2012) 1155-1161. We here explain the details of sample programs, and discuss the performance of the pre… Show more

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

0
9
0
1

Year Published

2015
2015
2024
2024

Publication Types

Select...
9

Relationship

2
7

Authors

Journals

citations
Cited by 17 publications
(10 citation statements)
references
References 23 publications
0
9
0
1
Order By: Relevance
“…where S r =(cos θ r , sin θ r ) denotes a planar spin vector with unit length at site r and the summation runs over pairs of nearest neighboring sites on a simple-cubic lattice. As listed in Table II [14]. Albeit these estimates are all based on Monte Carlo simulations, they are not completely consistent with each other.…”
Section: Modelsmentioning
confidence: 83%
“…where S r =(cos θ r , sin θ r ) denotes a planar spin vector with unit length at site r and the summation runs over pairs of nearest neighboring sites on a simple-cubic lattice. As listed in Table II [14]. Albeit these estimates are all based on Monte Carlo simulations, they are not completely consistent with each other.…”
Section: Modelsmentioning
confidence: 83%
“…If a spatial decomposition strategy is to be used, it must be applied to the cluster selection and cluster identification. This has been achieved for Swendsen/Wang and Wolff algorithms for lattice spin models recently [12,13], and these algorithms have been implemented with efficiency gains on GPUs.…”
Section: Introductionmentioning
confidence: 99%
“…On the other hand, the MC simulation methods are based on inter-atomic properties, and therefore, modeling of mesoscopic systems results in significant consumption of computational resources. This problem can be solved using parallelization of the MC algorithm [ 20 , 21 ]. Unfortunately, in order to study magnetization processes of ferromagnetic systems, it is necessary to utilize one of the cluster MC methods, and therefore, the possible parallelization is rather problematic.…”
Section: Introductionmentioning
confidence: 99%