We present sample CUDA programs for the GPU computing of the Swendsen-Wang multi-cluster spin flip algorithm. We deal with the classical spin models; the lsing model, the q-state Potts model, and the classical XY model. As for the lattice, both the 20 (square) lattice and the 3D (simple cubic) lattice are treated. We already reported the idea of the CPU implementation for 2D models (Komura and Okabe, 2012). We here explain the details of sample programs, and discuss the performance of the present CPU implementation for the 3D Ising and XY models. We also show the calculated results of the moment ratio for these models, and discuss phase transitions.
Program summary
Program title: SWspin
Catalogue identifier: AERM_v1_0
Program summary URL: http://cpc.cs.qub.ac.uk/summaries/AERM_v1_0.html
Program obtainable from: CPC Program Library, Queen's University, Belfast, N. Ireland
Licensing provisions: Standard CPC licence, http://cpc.cs.qub.ac.uk/licence/licence.html
No. of lines in distributed program, including test data, etc.: 5632
No. of bytes in distributed program, including test data, etc.: 14688
Distribution format: tar.gz
Programming language: C, CUDA.
Computer: System with an NVIDIA CUDA enabled CPU.
Operating system: System with an NVID1A CUDA enabled CPU.
Classification: 23.
External routines: NVIDIA CUDA Toolkit 3.0 or newer
Nature of problem:
Monte Carlo simulation of classical spin systems. Ising, q-state Potts model, and the classical XY model are treated for both two-dimensional and three-dimensional lattices.
Solution method:
GPU-based Swendsen-Wang multi-cluster spin flip Monte Carlo method. The CUDA implementation for the cluster-labeling is based on the work by Hawick et al. [1] and that by Kalentev et al. 121.
Restrictions:
The system size is limited depending on the memory of a CPU.
Running time:
For the parameters used in the sample programs, it takes about a minute for each program. Of course, it depends on the system size, the number of Monte Carlo steps, etc.
References:
[1] K.A. Hawick, A. Leist, and D. P. Playne, Parallel Computing 36 (2010) 655-678
[2] O. Kalentev, A. Rai, S. Kemnitzb, and R. Schneider, J. Parallel Distrib. Comput. 71 (2011) 615-620 (C) 2013 Elsevier B.V. All rights reserved.