GPU implementation of the Rosenbluth generation method for static Monte Carlo simulations
arXiv:1704.04381 · doi:10.1016/j.cpc.2017.03.006
Abstract
We present parallel version of Rosenbluth Self-Avoiding Walk generation method implemented on Graphics Processing Units (GPUs) using CUDA libraries. The method scales almost linearly with the number of CUDA cores and the method efficiency has only hardware limitations. The method is introduced in two realizations: on a cubic lattice and in real space. We find a good agreement between serial and parallel implementations and consistent results between lattice and real space realizations of the method for linear chain statistics. The developed GPU implementations of Rosenbluth algorithm can be used in Monte Carlo simulations and other computational methods that require large sampling of molecules conformations.
References in corpus (8)
- Biological and synthetic membranes: What can be learned from a coarse-grained description?
- A Portable High-Quality Random Number Generator for Lattice Field Theory Simulations
- Accelerating numerical solution of Stochastic Differential Equations with CUDA
- Scaling of Star Polymers with one to 80 Arms
- High-precision estimate of the hydrodynamic radius for self-avoiding walks
- Calculation of the connective constant for self-avoiding walks via the pivot algorithm
- Enhanced molecular dynamics performance with a programmable graphics processor
- GPU-based single-cluster algorithm for the simulation of the Ising model