Multipath Metropolis Simulation of Classical Heisenberg Model
arXiv:1305.6758 · doi:10.1016/j.physa.2015.08.038
Abstract
Processor cores are becoming less expensive and thus more accessible. To utilize increasing number of available computing elements, good parallel algorithms are necessary. In light of these changes in contemporary computing, multipath Metropolis simulation of classical Heisenberg model is explored. In contrast to the original single-path algorithm, multipath simulation approach is inherently parallel because different random-walk paths are mutually independent. This independence enables easy and efficient harnessing of numerous cores' computing power in embarrassingly parallel algorithms. Aside form being inherently parallel, multipath simulation approach results in independent and normally distributed simulation output. Normal distribution enables simple and straightforward statistical processing. Thus, multipath simulation results can be easily computed with arbitrary and statistically known precision.
arXiv comment14 pages, 17 figures
References in corpus (9)
- Statistical mechanics for natural flocks of birds
- Critical Exponents of the Classical 3D Heisenberg Model: A Single-Cluster Monte Carlo Study
- Finite size effects on measures of critical exponents in d=3 O(N) models
- Ashkin-Teller criticality and pseudo first-order behavior in a frustrated Ising model on the square lattice
- N-vector spin models on the sc and the bcc lattices: a study of the critical behavior of the susceptibility and of the correlation length by high temperature series extended to order beta^{21}
- Critical properties of the Kitaev-Heisenberg model
- Multi-GPU Accelerated Multi-Spin Monte Carlo Simulations of the 2D Ising Model
- Performance potential for simulating spin models on GPU
- Dynamic critical behavior of the classical anisotropic BCC Heisenberg antiferromagnet