Cluster and Fast-Update Simulations of Regular and Rewired Lattice Ising Models Using CUDA and Graphical Processing Units
Institute of Information and Mathematical Sciences, Massey University, Albany, North Shore 102-904, Auckland, New Zealand
Technical Report CSTN-104, Massey University, 2010
@article{hawick2010cluster,
title={Cluster and Fast-Update Simulations of Regular and Rewired Lattice Ising Models Using CUDA and Graphical Processing Units},
author={Hawick, KA and Leist, A. and Playne, DP},
year={2010}
}
Models such as the Ising system in computational physics are still important tools for analysing phase transitions and universal behaviours for new irregular and distorted lattice networks. Data-parallelism can be exploited to speed up such simulations as well as their analysis using general purpose graphical processing units (GPU) and other accelerating devices. We report on the use of various GPU performance optimisation techniques for both local update schemes like checkerboard Metropolis as well as non-local clusterupdate algorithms such as that of Wolff for the Ising model. We present some data-parallel algorithms and code fragments along with performance analysis and discussion of optimal GPU data memory models for this work including bit packed spin-coding techniques. We report some results on changes to the critical temperature arising from probabilistic small-world network rewiring as well as giving algorithms and performance data on parallelising irregular Ising model systems. We employ NVIDIA’s compute unified device architecture (CUDA) programming language and report on performance data achieved using modern many-core GPUs to optimise the “wall clock cost per decorrelated measurement” on both regular and irregular Ising models.
February 13, 2011 by hgpu