A probabilistic event scheduling policy for optimistic parallel discrete event simulation

A probabilistic scheduling policy for selecting the next event to be processed by a processor during optimistic parallel discrete event simulation is presented. This policy exploits the knowledge about statistical distributions of the difference between the timestamps of successively committed events of a logical process. Simulation results are presented to demonstrate that under appropriate conditions, probabilistic scheduling generates substantially fewer rollbacks compared to the lowest timestamp first scheduling policy.