Parallelization of a dynamic Monte Carlo algorithm: A partially rejection-free conservative approach

DOI10.1006/jcph.1999.6291zbMath0979.82043arXivcond-mat/9812344OpenAlexW3123558130MaRDI QIDQ1819039

M. A. Novotny, Per Arne Rikvold, Gyorgy Korniss

Publication date: 20 February 2002

Published in: Journal of Computational Physics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/cond-mat/9812344

zbMATH Keywords

Monte Carlo methodsparallel implementationferromagnetic systemsMetropolis algorithmmagnetizationperformancesdiscrete-event simulationkinetic Ising models: stochastic cellular automatarejection-free algorithms

Mathematics Subject Classification ID

Related Items (7)

Jump Markov chains and rejection-free Metropolis algorithms ⋮ Massively parallel Monte Carlo for many-particle simulations on GPUs ⋮ Invasive advance of an advantageous mutation: nucleation theory ⋮ Hierarchical fractional-step approximations and parallel kinetic Monte Carlo algorithms ⋮ Low-temperature long-time simulations of Ising ferromagnets using the Monte Carlo with absorbing Markov chains method ⋮ Spatial dynamics of invasion: the geometry of introduced species ⋮ Hybrid asynchronous algorithm for parallel kinetic Monte Carlo simulations of thin film growth

Uses Software

• MCAMC

Cites Work

• Unnamed Item
• Efficient parallel simulations of dynamic Ising spin systems
• Multi-spin coding: A very efficient technique for Monte Carlo simulations of spin systems
• Casting pearls ballistically: Efficient massively parallel simulation of particle deposition
• Monte Carlo simulation in statistical physics. An introduction.

This page was built for publication: Parallelization of a dynamic Monte Carlo algorithm: A partially rejection-free conservative approach