Hybrid Update Algorithms for Regular Lattice and Small-World Ising Models on Graphical Processing Units
Computer Science, Institute for Information and Mathematical Sciences, Massey University, North Shore 102-904, Auckland, New Zealand
CSTN Computational Science Technical Note Series, CSTN-148, 2012
@article{leist2012hybrid,
title={Hybrid Update Algorithms for Regular Lattice and Small-World Ising Models on Graphical Processing Units},
author={Leist, A. and Hawick, KA and Playne, DP},
year={2012}
}
Local and cluster Monte Carlo update algorithms offer a complex tradeoff space for optimising the performance of simulations of the Ising model. We systematically explore tradeoffs between hybrid Metropolis and Wolff cluster updates for the 3D Ising model using data-parallelism and graphical processing units. We investigate performance for both regular lattices as well as for small-world perturbations when the lattice becomes a generatised graph and locality can no longer be assumed. In spite of our use of customised Compute Unified Device Architecture (CUDA) code optimisations to implement it, we find the Wolff cluster update loses out in computational performance efficiency over the localised Metropolis algorithm systemically as the small-world rewiring parameter is increased. This manifests itself as a phase transition in the computational performance.
May 29, 2012 by hgpu
