17061

GPU accelerated population annealing algorithm

Lev Yu. Barash, Martin Weigel, Michal Borovsky, Wolfhard Janke, Lev N. Shchur
Landau Institute for Theoretical Physics, 142432 Chernogolovka, Russia
arXiv:1703.03676 [physics.comp-ph], (10 Mar 2017)

@article{barash2017accelerated,

   title={GPU accelerated population annealing algorithm},

   author={Barash, Lev Yu. and Weigel, Martin and Borovsky, Michal and Janke, Wolfhard and Shchur, Lev N.},

   year={2017},

   month={mar},

   archivePrefix={"arXiv"},

   primaryClass={physics.comp-ph}

}

Download Download (PDF)   View View   Source Source   

210

views

Population annealing is a promising recent approach for Monte Carlo simulations in statistical physics, in particular for the simulation of systems with complex free-energy landscapes. It is a hybrid method, combining importance sampling through Markov chains with elements of sequential Monte Carlo in the form of population control. While it appears to provide algorithmic capabilities for the simulation of such systems that are roughly comparable to those of more established approaches such as parallel tempering, it is intrinsically much more suitable for massively parallel computing. Here, we tap into this structural advantage and present a highly optimized implementation of the population annealing algorithm on GPUs that promises speed-ups of several orders of magnitude as compared to a serial implementation on CPUs. While the sample code is for simulations of the 2D ferromagnetic Ising model, it should be easily adapted for simulations of other spin models, including disordered systems. Our code includes implementations of some advanced algorithmic features that have only recently been suggested, namely the automatic adaptation of temperature steps and a multi-histogram analysis of the data at different temperatures.
VN:F [1.9.22_1171]
Rating: 3.7/5 (3 votes cast)
GPU accelerated population annealing algorithm, 3.7 out of 5 based on 3 ratings

* * *

* * *

HGPU group © 2010-2017 hgpu.org

All rights belong to the respective authors

Contact us: