Computational Science Technical Note CSTN-148

CSTN Home

Hybrid Update Algorithms for Regular Lattice and Small-World Ising Models on Graphical Processing Units

A. Leist, K. A. Hawick and D. P. Playne

Archived March 2011

Abstract

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 generalised graph and locality can no longer be assumed. In spite of our use of customised Comupte 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.

Keywords: Monte Carlo; cluster algorithm; local update; GPU; CUDA; phase transition.

Full Document Text: PDF version.

Citation Information: BiBTeX database for CSTN Notes.

BiBTeX reference:

@INPROCEEDINGS{CSTN-148,
  author = {A. Leist and K. A. Hawick and D. P. Playne},
  title = {Hybrid Update Algorithms for Regular Lattice and Small-world Ising
	Models on Graphical Processing Units},
  booktitle = {Proc. Int. Conf. on Scientific Computing (CSC'12)},
  year = {2012},
  pages = {228-234},
  address = {Las Vegas, USA},
  month = {16-19 July},
  publisher = {CSREA},
  institution = {Computer Science, Massey University},
  timestamp = {2012.05.03}
}


[ CSTN Index | CSTN BiBTeX ]