Billion-atom Synchronous Parallel Kinetic Monte Carlo Simulations of Critical 3D Ising Systems

Abstract

An extension of the synchronous parallel kinetic Monte Carlo (pkMC) algorithm developed by Martinez {\it et al} [{\it J.\ Comp.\ Phys.} {\bf 227} (2008) 3804] to discrete lattices is presented. The method solves the master equation synchronously by recourse to null events that keep all processors time clocks current in a global sense. Boundary conflicts are rigorously solved by adopting a chessboard decomposition into non-interacting sublattices. We find that the bias introduced by the spatial correlations attendant to the sublattice decomposition is within the standard deviation of the serial method, which confirms the statistical validity of the method. We have assessed the parallel efficiency of the method and find that our algorithm scales consistently with problem size and sublattice partition. We apply the method to the calculation of scale-dependent critical exponents in billion-atom 3D Ising systems, with very good agreement with state-of-the-art multispin simulations.

References in corpus (4)

• Bond dilution in the 3D Ising model: a Monte Carlo study
• Monte Carlo simulations and numerical solutions of short-time critical dynamics
• Local and cluster critical dynamics of the 3d random-site Ising model
• Crossovers in the Two Dimensional Ising Spin Glass with ferromagnetic next-nearest-neighbor interactions

Cited by in corpus (5)

• Path Factorization Approach to Stochastic Simulations
• Computationally-efficient stochastic cluster dynamics method for modeling damage accumulation in irradiated materials
• A rigorous sequential update strategy for parallel kinetic Monte Carlo simulation
• Absorption kinetics of vacancies by cavities in Aluminum: numerical characterization of sink strengths and first-passage statistics through Krylov subspace projection and eigenvalue deflation
• Order parameter of a three-dimensional Ising-like system in the simplest and higher non-Gaussian approximations