ACM Transactions on Programming Languages and Systems (TOPLAS)
Distributed discrete-event simulation
ACM Computing Surveys (CSUR)
Performance analysis of synchronization for two communicating processes
Performance Evaluation
Rollback sometimes works...if filtered
WSC '89 Proceedings of the 21st conference on Winter simulation
Parallel discrete event simulation
Communications of the ACM - Special issue on simulation
Time warp on a shared memory multiprocessor
Transactions of the Society for Computer Simulation International
Unboundedly parallel simulations via recurrence relations
SIGMETRICS '90 Proceedings of the 1990 ACM SIGMETRICS conference on Measurement and modeling of computer systems
Asynchronous distributed simulation via a sequence of parallel computations
Communications of the ACM - Special issue on simulation modeling and statistical computing
Time, clocks, and the ordering of events in a distributed system
Communications of the ACM
Performance Analysis of a Rollback Method for Distributed Simulation
Performance '83 Proceedings of the 9th International Symposium on Computer Performance Modelling, Measurement and Evaluation
An approach to performance analysis of timestamp-driven synchronization mechanisms
PODC '84 Proceedings of the third annual ACM symposium on Principles of distributed computing
Asynchronous algorithms for the parallel simulation of event-driven dynamical systems
ACM Transactions on Modeling and Computer Simulation (TOMACS)
The cost of conservative synchronization in parallel discrete event simulations
Journal of the ACM (JACM)
A performance model for parallel simulation
WSC '91 Proceedings of the 23rd conference on Winter simulation
Fully dynamic epoch time synchronisation method for distributed supply chain simulation
International Journal of Computer Applications in Technology
| Hi-index | 0.00 |
The behavior of n interacting processors synchronized by the "Time Warp" protocol is analyzed using a discrete state continuous time Markov chain model. The performance and dynamics of the processes are analyzed under the following assumptions: exponential task times and times-tamp increments on messages, each event message generates one new message that is sent to a randomly selected process, negligible rollback, state saving, and communication delay, unbounded message buffers, and homogeneous processors that are never idle. We determine the fraction of processed events that commit, speedup, rollback probability, expected length of rollback, the probability mass function for the number of uncommitted processed events, and the probability distribution function for the virtual time of a process. The analysis is approximate, so the results have been validated through performance measurements of a Time Warp testbed (PHOLD workload model) executing on a shared memory multiprocessor.