Abstract An event-driven method for parallel simulation of a class dynamic Monte Carlo models is presented. The method can be applied to several models studied in the computational physics such as Ising spin simulations by the method of Metropolis, Rosenbluth, Rosenbluth, Teller, and Teller, continuous time Ising spin simulation by Glauber, and the dynamic binary alloy simulation. Unlike previously known parallel multi-spin algorithms, the proposed algorithms do not change the simulated model. For example, the asynchrony and randomness of update time arrivals which are present in Glauber's formulation, are not disturbed here and the simulated update history is precisely the same as it is in the serial algorithm. The theoretical efficiency evaluation is encouraging: for 768 × 768 spins using a parallel processor with 256 processing elements, the estimated efficiency is not lower than 71%. This means a parallel speed-up of 180 in the computations which were previously believed inherently serial. The algorithm by Bortz, Kalos, and Lebowitz can be incorporated, further contributing to speed-up.
[1]
R. Glauber.
Time‐Dependent Statistics of the Ising Model
,
1963
.
[2]
Claude Berge,et al.
Graphs and Hypergraphs
,
2021,
Clustering.
[3]
A. B. Bortz,et al.
A new algorithm for Monte Carlo simulation of Ising spin systems
,
1975
.
[4]
Ogielski,et al.
Dynamics of three-dimensional Ising spin glasses in thermal equilibrium.
,
1985,
Physical review. B, Condensed matter.
[5]
E. Ising.
Beitrag zur Theorie des Ferromagnetismus
,
1925
.
[6]
J. Keilson.
Markov Chain Models--Rarity And Exponentiality
,
1979
.
[7]
N. Metropolis,et al.
Equation of State Calculations by Fast Computing Machines
,
1953,
Resonance.
[8]
M. Creutz.
Deterministic Ising dynamics
,
1986
.
[9]
R. Friedberg,et al.
Test of the Monte Carlo Method: Fast Simulation of a Small Ising Lattice
,
1970
.
[10]
W. Daniel Hillis,et al.
The connection machine
,
1985
.