On the processor scheduling problem in time warp synchronization

Time Warp is a synchronization mechanism for parallel/distributed simulation. It allows logical processes (LPs) to execute events without the guarantee of a causally consistent execution. Upon the detection of a causality violation, rollback procedures recover the state of the simulation to a correct value. When a rollback occurs there are two primary sources of performance loss: (1) CPU time must be spent for the execution of the rollback procedures and (2) waste of CPU time arises from the invalidation of event executions. In this paper we present a general framework for the problem of scheduling the next LP to be run on a processor in Time Warp simulations. The framework establishes a class of scheduling algorithms having the twofold aim to keep low the CPU time for the execution of the rollback procedures and also to guarantee low waste of time due to event executions invalidated by rollback. The combination of these two aims should actually lead to short completion time of Time Warp simulations.We collocate existing scheduling algorithms within the framework, pointing out how they miss previous aims, at least partially. Then we instantiate a Window-based Grain Sensitive (WGS) scheduling algorithm relying on the framework, which pursues the above twofold aim. We also identify the proper conditions, associated with the simulation model execution, under which any algorithm exploiting the framework structure is expected to benefit the performance of the Time Warp mechanism. Empirical evidence from an experimental study of WGS on classical benchmarks and on a mobile communication system simulation fully confirms the theoretical outcomes.

[1]  David R. Jefferson,et al.  Virtual time , 1985, ICPP.

[2]  RegoVernon,et al.  Minimum cost adaptive synchronization , 1998 .

[3]  Rassul Ayani,et al.  Adaptive checkpointing in Time Warp , 1994, PADS '94.

[4]  Robert Rönngren,et al.  Service oriented scheduling in time warp , 1994, Proceedings of Winter Simulation Conference.

[5]  Paul F. Reynolds,et al.  Elastic time , 1998, TOMC.

[6]  Sajal K. Das,et al.  Exploiting model independence for parallel PCS network simulation , 1999, Proceedings Thirteenth Workshop on Parallel and Distributed Simulation. PADS 99. (Cat. No.PR00155).

[7]  QuagliaFrancesco,et al.  On the processor scheduling problem in time warp synchronization , 2002 .

[8]  Sudhir Srinivasan,et al.  NPSI adaptive synchronization algorithms for parallel discrete event simulation , 1996 .

[9]  Francesco Quaglia.  A Cost Model for Selecting Checkpoint Positions in Time Warp Parallel Simulation , 2001, IEEE Trans. Parallel Distributed Syst..

[10]  Wayne M. Loucks,et al.  On the Trade-off between Time and Space in Optimistic Parallel Discrete-Event Simulation , 1992 .

[11]  Philip A. Wilsey,et al.  Scheduling Time Warp processes using adaptive control techniques , 1994, Proceedings of Winter Simulation Conference.

[12]  Paul F. Reynolds,et al.  NPSI adaptive synchronization algorithms for PDES , 1995, Winter simulation conference : proceedings.

[13]  Christopher D. Carothers,et al.  ROSS: a high-performance, low memory, modular time warp system , 2000, Proceedings Fourteenth Workshop on Parallel and Distributed Simulation.

[14]  Robert G. Sargent,et al.  A probabilistic event scheduling policy for optimistic parallel discrete event simulation , 1998, Workshop on Parallel and Distributed Simulation.

[15]  R. M. Fujimoto,et al.  Parallel discrete event simulation , 1989, WSC '89.

[16]  Richard M. Fujimoto,et al.  Computing global virtual time in shared-memory multiprocessors , 1997, TOMC.

[17]  Alois Ferscha.  Probabilistic adaptive direct optimism control in Time Warp , 1995, PADS.

[18]  Wayne M. Loucks,et al.  Effects of the checkpoint interval on time and space in time warp , 1994, TOMC.

[19]  Francesco Quaglia.  A state-based scheduling algorithm for time warp synchronization , 2000, Proceedings 33rd Annual Simulation Symposium (SS 2000).

[20]  Paul F. Reynolds,et al.  Implementation of reductions in support of PDES on a network of workstations , 1998, Workshop on Parallel and Distributed Simulation.

[21]  Christopher D. Carothers,et al.  A case study in simulating PCS networks using Time Warp , 1995, PADS.

[22]  Anand R. Tripathi,et al.  Evaluation of a Local Adaptive Protocol for Distributed Discrete Event Simulation , 1994, 1994 International Conference on Parallel Processing Vol. 3.

[23]  Paul F. Reynolds.  A spectrum of options for parallel simulation , 1988, WSC '88.

[24]  Nael B. Abu-Ghazaleh,et al.  OFC: A Distributed Fossil-Collection Algorithm for Time-Warp , 1998, DISC.

[25]  A. Chien,et al.  High Performance Messaging on Workstations: Illinois Fast Messages (FM) for Myrinet , 1995, Proceedings of the IEEE/ACM SC95 Conference.

[26]  Alois Ferscha,et al.  Estimating rollback overhead for optimism control in Time Warp , 1995, Proceedings of Simulation Symposium.

[27]  Richard M. Fujimoto,et al.  An Empirical Evaluation of Performance-Memory Trade-Offs in Time Warp , 1997, IEEE Trans. Parallel Distributed Syst..

[28]  Richard M. Fujimoto,et al.  An Adaptive Memory Management Protocol for Time Warp Simulation , 1994, SIGMETRICS.