Efficient parallel simulations of dynamic Ising spin systems
Journal of Computational Physics
Parallel discrete event simulation
Communications of the ACM - Special issue on simulation
Performance bounds on parallel self-initiating discrete-event simulations
ACM Transactions on Modeling and Computer Simulation (TOMACS)
Bounds and approximations for self-initiating distributed simulation without lookahead
ACM Transactions on Modeling and Computer Simulation (TOMACS) - Special issue on parallel and distributed systems performance
PADS '93 Proceedings of the seventh workshop on Parallel and distributed simulation
Discrete-event simulation and the event horizon
PADS '94 Proceedings of the eighth workshop on Parallel and distributed simulation
Asynchronous updates in large parallel systems
Proceedings of the 1996 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Discrete-event simulation and the event horizon part 2: event list management
PADS '96 Proceedings of the tenth workshop on Parallel and distributed simulation
Parallelization of a dynamic Monte Carlo algorithm: a partially rejection-free conservative approach
Journal of Computational Physics
Asynchronous distributed simulation via a sequence of parallel computations
Communications of the ACM - Special issue on simulation modeling and statistical computing
Spatio-temporal correlations and rollback distributions in optimistic simulations
Proceedings of the fifteenth workshop on Parallel and distributed simulation
| Hi-index | 0.00 |
We investigate the universal characteristics of the simulated time horizon of the basic conservative parallel algorithm when implemented on regular lattices. This technique [1, 2] is generically applicable to various physical, biological, or chemical systems where the underlying dynamics is asynchronous. Employing direct simulations, and using standard tools and the concept of dynamic scaling from non-equilibrium surface/interface physics, we identify the universality class of the time horizon and determine its implications for the asymptotic scalability of the basic conservative scheme. Our main finding is that while the simulation converges to an asymptotic nonzero rate of progress, the statistical width of the time horizon diverges with the number of PEs in a power law fashion. This is in contrast with the findings of Ref. [3]. This information can be very useful, e.g., we utilize it to understand optimizing the size of a moving "time window" to enforce memory constraints.