Parallelization of a dynamic Monte Carlo algorithm: A partially rejection-free conservative approach
- Florida State Univ., Tallahassee, FL (United States)
The authors experiment with a massively parallel implementation of an algorithm for simulating the dynamics of metastable decay in kinetic Ising models. The parallel scheme is directly applicable to a wide range of stochastic cellular automata where the discrete events (updates) are Poisson arrivals. For high performance, they utilize a continuous-time, asynchronous parallel version of the n-fold way rejection-free algorithm. Each processing element carries an l {times} l block of spins, and they employ fast one-sided communication routines on a distributed-memory parallel architecture. Different processing elements have different local simulated times. To ensure causality, the algorithm handles the asynchrony in a conservative fashion. Despite relatively low utilization and an intricate relationship between the average time increment and the size of the spin blocks, they find that the algorithm is scalable and for sufficiently large l it outperforms its corresponding parallel Metropolis (non-rejection-fee) counterpart. As a sample application, they present results for metastable decay in a model ferromagnetic or ferroelectric film, observed with a probe of area smaller than the total system.
- Sponsoring Organization:
- USDOE, Washington, DC (United States); National Science Foundation, Washington, DC (United States)
- DOE Contract Number:
- FG02-85ER25000; AC03-76SF00098
- OSTI ID:
- 687483
- Journal Information:
- Journal of Computational Physics, Vol. 153, Issue 2; Other Information: PBD: 10 Aug 1999
- Country of Publication:
- United States
- Language:
- English
Similar Records
Hybrid asynchronous algorithm for parallel kinetic Monte Carlo simulations of thin film growth
An Asynchronous Task-based Fan-Both Sparse Cholesky Solver