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

Physics – Condensed Matter – Statistical Mechanics

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

Scientific paper

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.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Billion-atom Synchronous Parallel Kinetic Monte Carlo Simulations of Critical 3D Ising Systems does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Billion-atom Synchronous Parallel Kinetic Monte Carlo Simulations of Critical 3D Ising Systems, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Billion-atom Synchronous Parallel Kinetic Monte Carlo Simulations of Critical 3D Ising Systems will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-604681

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.