Massively parallel multicanonical simulations

Jonathan Groß

doi:10.1016/j.cpc.2017.10.018

Massively parallel multicanonical simulations

2018-03-01

11

OA

AI

DOI：10.1016/j.cpc.2017.10.018

原文链接

查看原文

摘要

En 中文

Generalized-ensemble Monte Carlo simulations such as the multicanonical method and similar techniques are among the most efficient approaches for simulations of systems undergoing discontinuous phase transitions or with rugged free-energy landscapes. As Markov chain methods, they are inherently serial computationally. It was demonstrated recently, however, that a combination of independent simulations that communicate weight updates at variable intervals allows for the efficient utilization of parallel computational resources for multicanonical simulations. Implementing this approach for the many-thread architecture provided by current generations of graphics processing units (GPUs), we show how it can be efficiently employed with of the order of 104 parallel walkers and beyond, thus constituting a versatile tool for Monte Carlo simulations in the era of massively parallel computing. We provide the fully documented source code for the approach applied to the paradigmatic example of the two-dimensional Ising model as starting point and reference for practitioners in the field. Program summary Program Title: cudamuca Program Files doi: http://dx.doLorg/10.17632/tzhfpdymv9.1 Licensing provisions: Creative Commons Attribution license (CC BY 4.0) Programming language: C++, CODA External routines/libraries: NVIDIA CODA Toolkit 6.5 or newer Nature of problem: The program determines weights for a multicanonical simulation of the 2D Ising model to result in a flat energy histogram. A final production run with these weights provides an estimate of the density of states of the model. Solution method: The code uses a parallel variant of the multicanonical method employing many parallel walkers that accumulate a common histogram. The resulting histogram is used to determine the weight function for the next iteration. Once the iteration has converged, simulations visit all possible energies with the same probability. Additional comments including restrictions and unusual features: The system size and size of the population of replicas are limited depending on the memory of the GPO device used. Code repository at https: figithub.com/CQT-Leipzigicudamuca. (C) 2017 Published by Elsevier B.V.

Keyword:

GPU

Parallel computing

Monte Carlo simulations

Multicanonical

Ising model

Massively parallel multicanonical simulations

摘要

AI总结

期刊

机构

引用论文