Parallelized Stochastic Cutoff Method for Long-Range Interacting Systems
arXiv:1503.03295 · doi:10.7566/JPSJ.84.074002
Abstract
We present a method to parallelize the stochastic cutoff (SCO) method, which is a Monte-Carlo method for long-range interacting systems. After interactions are eliminated by the SCO method, we subdivide the lattice into non-interacting interpenetrating sublattices. This subdivision enables us to parallelize Monte-Carlo calculation in the SCO method. Such subdivision is found by numerically solving the vertex coloring of a graph created by the SCO method. We use an algorithm proposed by Kuhn and Wattenhofer to solve the vertex coloring by parallel computation. The present method was applied to a two-dimensional magnetic dipolar system on an square lattice to examine its parallelization efficiency. The result showed that, in the case of L=2304, the speed of computation increased about 102 times by parallel computation with 288 processors.
arXiv comment8 pages, 10 figures; 2 figures are added
References in corpus (10)
- A scalable parallel Monte Carlo algorithm for atomistic simulations of precipitation in alloys
- Order-N Cluster Monte Carlo Method for Spin Systems with Long-range Interactions
- Massively parallel Monte Carlo for many-particle simulations on GPUs
- Parallelization of a Dynamic Monte Carlo Algorithm: a Partially Rejection-Free Conservative Approach
- GPU-based Swendsen-Wang multi-cluster algorithm for the simulation of two-dimensional classical spin systems
- Phase Transition in 3d Heisenberg Spin Glasses with Strong Random Anisotropies, through a Multi-GPU Parallelization
- Stochastic Cutoff Method for Long-Range Interacting Systems
- Hierarchical fractional-step approximations and parallel kinetic Monte Carlo algorithms
- A New Monte Carlo Method and Its Implications for Generalized Cluster Algorithms
- Reformulation of the Stochastic Potential Switching Algorithm and a Generalized Fourtuin-Kasteleyn Representation