Efficient Correlation-Free Many-States Lattice Monte Carlo on GPUs
Efficient Correlation-Free Many-States Lattice Monte Carlo on GPUs
Kelling, J.; Ódor, G.; Weigel, M.; Gemming, S.
We'll present a method for highly efficient lattice Monte Carlo simulations with correlation-free updates. Achieving freedom from erroneous correlations requires random selection of lattice sites for updates, which must be restricted by suitable domain decomposition to create parallelism. While approaches based on caching limit the number of allowed states, the multisurface-type approach presented here allows arbitrarily complex states. The effectiveness of the method is illustrated in the fact that it allowed us to solve a long-standing dispute around surface growth under random kinetic deposition in the KPZ-universality class. The method has also been applied to Potts models and is suitable for spin-glass simulations, such as those required to test quantum annealers, like D-Wave.
Keywords: Lattice Monte Carlo; GPU; Surface Growth; Kardar-Parisi-Zhang
-
Lecture (Conference)
GPU Technology Conference, 08.-11.05.2017, San Jose, CA, USA -
Contribution to WWW
http://on-demand.gputechconf.com/gtc/2017/presentation/s7240-jeffrey-kelling-efficient-correlation.pdf -
Invited lecture (Conferences)
GPU Day 2018, 21.-22.06.2018, Budapest, Hungary
Permalink: https://www.hzdr.de/publications/Publ-25585
Publ.-Id: 25585