ACM Transactions on Programming Languages and Systems (TOPLAS)
Efficient parallel simulations of dynamic Ising spin systems
Journal of Computational Physics
Synchronous relaxation for parallel simulations with applications to circuit-switched networks
ACM Transactions on Modeling and Computer Simulation (TOMACS)
Optimistic parallel simulation of continuous time Markov chains using uniformization
Journal of Parallel and Distributed Computing - Special issue on parallel and discrete event simulation
Conservative Parallel Simulation of Continuous Time Markov Chains Using Uniformization
IEEE Transactions on Parallel and Distributed Systems
The Monte Carlo Method in Science and Engineering
Computing in Science and Engineering
Synchronous parallel kinetic Monte Carlo for continuum diffusion-reaction systems
Journal of Computational Physics
| Hi-index | 0.01 |
A new parallel algorithm for simulating Ising spin systems is presented. The sequential prototype is the n-fold way algorithm [2], which is efficient but is hard to parallelize using conservative methods. Our parallel algorithm is optimistic. Unlike other optimistic algorithms, e.g., Time Warp, our algorithm is synchronous. It also belongs to the class of simulations known as “relaxation” [3]; hence it is named “synchronous relaxation.” We derive performance guarantees for this algorithm. If N is the number of PEs, then under weak assumptions we show that the number of correct events processed per unit of time is, on average, at least of order N/ log N. All communication delays, processing time, and busy waits are taken into account.