A probabilistic event scheduling policy for optimistic parallel discrete event simulation

Author

Som, Tapas K. ; Sargent, Robert G.

Author_Institution

Simulation Res. Group, Syracuse Univ., NY, USA

fYear

1998

fDate

26-29 May 1998

Firstpage

56

Lastpage

63

Abstract

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

Keywords

discrete event simulation; parallel programming; probability; scheduling; statistical analysis; system recovery; logical process; lowest timestamp first scheduling policy; optimistic parallel discrete event simulation; probabilistic event scheduling policy; probabilistic scheduling; rollbacks; simulation results; statistical distributions; successively committed events; timestamps; Computational modeling; Discrete event simulation; Processor scheduling; Scheduling algorithm; Statistical distributions;

fLanguage

English

Publisher

ieee

Conference_Titel

Parallel and Distributed Simulation, 1998. PADS 98. Proceedings. Twelfth Workshop on

Conference_Location

Banff, Alta.

Print_ISBN

0-8186-8457-7

Type

conf

DOI

10.1109/PADS.1998.685270

Filename

685270