Probabilistic adaptive direct optimism control in Time Warp
PADS '95 Proceedings of the ninth workshop on Parallel and distributed simulation
Estimating the cost of throttled execution in time warp
PADS '96 Proceedings of the tenth workshop on Parallel and distributed simulation
Adaptive protocols for parallel discrete event simulation
WSC '96 Proceedings of the 28th conference on Winter simulation
Minimum cost adaptive synchronization: experiments with the ParaSol system
Proceedings of the 29th conference on Winter simulation
Adaptive flow control in time warp
Proceedings of the eleventh workshop on Parallel and distributed simulation
Speculative parallel simulation with an adaptive throttle scheme
Proceedings of the eleventh workshop on Parallel and distributed simulation
Event history based sparse state saving in time warp
PADS '98 Proceedings of the twelfth workshop on Parallel and distributed simulation
Combining optimism limiting schemes in time warp based parallel simulations
Proceedings of the 30th conference on Winter simulation
Minimum cost adaptive synchronization: experiments with the ParaSol system
ACM Transactions on Modeling and Computer Simulation (TOMACS) - Special issue on Web-based modeling and simulation
On learning algorithms and balancing loads in Time Warp
PADS '99 Proceedings of the thirteenth workshop on Parallel and distributed simulation
Combining periodic and probabilistic checkpointing in optimistic simulation
PADS '99 Proceedings of the thirteenth workshop on Parallel and distributed simulation
Trade-Off between Sequential and Time Warp-Based Parallel Simulation
IEEE Transactions on Parallel and Distributed Systems
An empirical study of conservative scheduling
PADS '00 Proceedings of the fourteenth workshop on Parallel and distributed simulation
Grain sensitive event scheduling in time warp parallel discrete event simulation
PADS '00 Proceedings of the fourteenth workshop on Parallel and distributed simulation
A scaled version of the elastic time algorithm
Proceedings of the fifteenth workshop on Parallel and distributed simulation
A Cost Model for Selecting Checkpoint Positions in Time Warp Parallel Simulation
IEEE Transactions on Parallel and Distributed Systems
Proceedings of the 32nd conference on Winter simulation
A restriction of the elastic time algorithm
Information Processing Letters
Adaptive Time Warp Simulation of Timed Petri Nets
IEEE Transactions on Software Engineering
On the processor scheduling problem in time warp synchronization
ACM Transactions on Modeling and Computer Simulation (TOMACS)
Improving Optimistic PDES in PVM Environments
Proceedings of the 7th European PVM/MPI Users' Group Meeting on Recent Advances in Parallel Virtual Machine and Message Passing Interface
ICS '03 Proceedings of the 17th annual international conference on Supercomputing
Time Warp Simulation of Timed Petri Nets Sensitivity of Adaptive Methods
PNPM '97 Proceedings of the 6th International Workshop on Petri Nets and Performance Models
Length-based Blocking Strategy and Local Estimations in Distributed Simulation: A Case Study
SS '96 Proceedings of the 29th Annual Simulation Symposium (SS '96)
Journal of Parallel and Distributed Computing
Decision-Theoretic Throttling for Optimistic Simulations of Multi-Agent Systems
DS-RT '05 Proceedings of the 9th IEEE International Symposium on Distributed Simulation and Real-Time Applications
Using DVFS to optimize time warp simulations
Proceedings of the Winter Simulation Conference
| Hi-index | 0.00 |
The main performance pitfall of the Time Warp distributed discrete event simulation (DDES) protocol has been widely recognized to be the overoptimistic progression of event execution into the simulated future. The premature execution of events that eventually have to be "rolled back" due to causality violations induces memory and communication overheads as sources of performance inefficiencies. Optimistic Time Windows and self adaptive mechanisms have been proposed in the literature to control the optimism in Time Warp in order to improve or optimize its execution performance. An adaptive optimism control mechanism based on the observed model parallelism is proposed. Methodologically, logical processes (LPs) monitor the local virtual time (LVT) progression per unit CPU time from the timestamp of arriving messages and establish a cost model for the tradeoff between optimistically progressing and conservatively blocking the simulation engine. Compared to previous approaches, an optimal CPU delay interval is computed from the rollback probability and the overhead induced by the rollback procedure, such that the LP can adapt the synchronization behavior to the amount of optimism that can be justified from the parallelism inherent in the simulation model. Experiments with an implementation on a distributed memory multiprocessor (iPSC/860) show that the protocol is able to automatically adjust the local virtual time progression such that rollback overhead is minimized, and that the original Time Warp protocol can be outperformed.