A probabilistic event scheduling policy for optimistic parallel discrete event simulation

A probabalistic schedrding policy for selecting the next event to be processed by a processor during optimistic parallel discrete event samulation is presented.Thus polzcy exploits the knowledge about statistical drstrabutions of the diflerence between the timestamps of successively committed events of a logical process.Simulation results are presented to demonstrate that under appropriatt-conditions probabilistic scheduling generates substantially fewer-number of rollbacks compared to the lowest timestamp first scheduling policy.