Scalable parallel Monte Carlo algorithm for atomistic simulations of precipitation in alloys

Sadigh, Babak; Erhart, Paul; Stukowski, Alexander; Caro, Alfredo; Martinez, Enrique; Zepeda-Ruiz, Luis

doi:10.1103/PhysRevB.85.184203

Title: Scalable parallel Monte Carlo algorithm for atomistic simulations of precipitation in alloys

Full Record
Other Related Research

Authors:: Sadigh, Babak; Erhart, Paul; Stukowski, Alexander; Caro, Alfredo; Martinez, Enrique; Zepeda-Ruiz, Luis

Publication Date:: Fri May 11 00:00:00 EDT 2012

Sponsoring Org.:: USDOE

OSTI Identifier:: 1101281

Resource Type:: Publisher's Accepted Manuscript

Journal Name:: Physical Review B

Additional Journal Information:: Journal Volume: 85; Journal Issue: 18; Journal ID: ISSN 1098-0121

Publisher:: American Physical Society

Country of Publication:: United States

Language:: English

Citation Formats


                    Sadigh, Babak, Erhart, Paul, Stukowski, Alexander, Caro, Alfredo, Martinez, Enrique, and Zepeda-Ruiz, Luis. Scalable parallel Monte Carlo algorithm for atomistic simulations of precipitation in alloys.  United States: N. p., 2012. 
Web.  doi:10.1103/PhysRevB.85.184203.

Copy to clipboard


                    Sadigh, Babak, Erhart, Paul, Stukowski, Alexander, Caro, Alfredo, Martinez, Enrique, & Zepeda-Ruiz, Luis. Scalable parallel Monte Carlo algorithm for atomistic simulations of precipitation in alloys.  United States.  https://doi.org/10.1103/PhysRevB.85.184203

Copy to clipboard


                    Sadigh, Babak, Erhart, Paul, Stukowski, Alexander, Caro, Alfredo, Martinez, Enrique, and Zepeda-Ruiz, Luis. Fri .  
"Scalable parallel Monte Carlo algorithm for atomistic simulations of precipitation in alloys".  United States.  https://doi.org/10.1103/PhysRevB.85.184203.

Copy to clipboard


                    
@article{osti_1101281,

  title        = {Scalable parallel Monte Carlo algorithm for atomistic simulations of precipitation in alloys},

  author       = {Sadigh, Babak and Erhart, Paul and Stukowski, Alexander and Caro, Alfredo and Martinez, Enrique and Zepeda-Ruiz, Luis},

  abstractNote = {},

  doi          = {10.1103/PhysRevB.85.184203},

  journal      = {Physical Review B},

  number       = 18,

  volume       = 85,

  place        = {United States},

  year         = {Fri May 11 00:00:00 EDT 2012},

  month        = {Fri May 11 00:00:00 EDT 2012}

}

Copy to clipboard

Journal Article:

Free Publicly Available Full Text

Accepted Manuscript (Publisher)

Publisher's Version of Record
https://doi.org/10.1103/PhysRevB.85.184203

Other availability

Search WorldCat to find libraries that may hold this journal

Citation Metrics:

Cited by: 160 works

Citation information provided by
Web of Science

Save / Share:

Export Metadata

Save to My Library

Similar Records in DOE PAGES and OSTI.GOV collections:

A derivation and scalable implementation of the synchronous parallel kinetic Monte Carlo method for simulating long-time dynamics

Journal Article Byun, Hye Suk ; El-Naggar, Mohamed Y. ; Kalia, Rajiv K. ; ... - Computer Physics Communications

Kinetic Monte Carlo (KMC) simulations are used to study long-time dynamics of a wide variety of systems. Unfortunately, the conventional KMC algorithm is not scalable to larger systems, since its time scale is inversely proportional to the simulated system size. A promising approach to resolving this issue is the synchronous parallel KMC (SPKMC) algorithm, which makes the time scale size-independent. This paper introduces a formal derivation of the SPKMC algorithm based on local transition-state and time-dependent Hartree approximations, as well as its scalable parallel implementation based on a dual linked-list cell method. The resulting algorithm has achieved a weak-scaling parallelmore »« less
Cited by 3
https://doi.org/10.1016/j.cpc.2017.05.028

Full Text Available
Scalable algorithms for domain decomposition of Monte Carlo neutral particle transport simulations on unstructured mesh

Conference Giudicelli, Guillaume Louis ; Harbour, Logan H ; Crowder, Robert

Monte Carlo simulations are the gold standard in particle transport simulations, for shielding and nuclear reactor simulations Full core simulations can require terabytes of memory for tracking pin-resolved (up to 50k pins), nuclide (200 tracked), axial (20-200 zones) reaction rates Domain decomposition, splitting the calculation and the memory storage, among several nodes is challenging as it involves communication of particles across domain boundaries We created a new MOOSE application, MaCaw, to study this problem Algorithms developed for ray tracing in MOOSE were adapted for simulating neutral particle transport Physics and tally routines in OpenMC, dynamically linked, are called from themore » application« less
Full Text Available
Hybrid asynchronous algorithm for parallel kinetic Monte Carlo simulations of thin film growth

Journal Article Shim, Yunsic ; Amar, Jacques G - Journal of Computational Physics

We have generalized and implemented the hybrid asynchronous algorithm, originally proposed for parallel simulations of the spin-flip Ising model, in order to carry out parallel kinetic Monte Carlo (KMC) simulations. The parallel performance has been tested using a simple model of thin-film growth in both 1D and 2D. We also briefly describe how the data collection must be modified as compared to the case of the spin-flip Ising model in order to carry out rigorous data collection. Due to the presence of a wide range of rates in the simulations, this algorithm turns out to be very inefficient. The poormore »« less
https://doi.org/10.1016/j.jcp.2005.07.005
Accelerating population balance-Monte Carlo simulation for coagulation dynamics from the Markov jump model, stochastic algorithm and GPU parallel computing

Journal Article Xu, Zuwei ; Zhao, Haibo ; Zheng, Chuguang - Journal of Computational Physics

This paper proposes a comprehensive framework for accelerating population balance-Monte Carlo (PBMC) simulation of particle coagulation dynamics. By combining Markov jump model, weighted majorant kernel and GPU (graphics processing unit) parallel computing, a significant gain in computational efficiency is achieved. The Markov jump model constructs a coagulation-rule matrix of differentially-weighted simulation particles, so as to capture the time evolution of particle size distribution with low statistical noise over the full size range and as far as possible to reduce the number of time loopings. Here three coagulation rules are highlighted and it is found that constructing appropriate coagulation rule providesmore »« less
https://doi.org/10.1016/J.JCP.2014.10.055
Overcoming artificial spatial correlations in simulations of superstructure domain growth with parallel Monte Carlo algorithms

Journal Article Schleier, W ; Besold, G ; Heinz, K - Journal of Statistical Physics; (United States)

The authors study the applicability of parallelized/vectorized Monte Carlo (MC) algorithms to the simulation of domain growth in two-dimensional lattice gas models undergoing an ordering process after a rapid quench below an order-disorder transition temperature. As examples they consider models with 2 [times] 1 and c(2 [times] 2) equilibrium superstructures on the square and rectangular lattices, respectively. They also study the case of phase separation ( 1 [times] 1' islands) on the square lattice. A generalized parallel checkerboard algorithm for Kawasaki dynamics is shown to give rise to artificial spatial correlations in all three models. However, only if superstructure domainsmore »« less
https://doi.org/10.1007/BF01055719

Similar Records