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
Performance bounds on parallel self-initiating discrete-event simulations
ACM Transactions on Modeling and Computer Simulation (TOMACS)
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
Bounds and approximations for self-initiating distributed simulation without lookahead
ACM Transactions on Modeling and Computer Simulation (TOMACS) - Special issue on parallel and distributed systems performance
Performance analysis of “Time Warp” with limited memory
SIGMETRICS '92/PERFORMANCE '92 Proceedings of the 1992 ACM SIGMETRICS joint international conference on Measurement and modeling of computer systems
How using busses in multicomputer programs affects conservative parallel simulation
PADS '93 Proceedings of the seventh workshop on Parallel and distributed simulation
State of the art in parallel simulation
WSC '92 Proceedings of the 24th conference on Winter simulation
Effect of communication overheads on Time Warp performance: an experimental study
PADS '94 Proceedings of the eighth workshop on Parallel and distributed simulation
Towards “on the fly” performance models for conservative asynchronous protocols
WSC '94 Proceedings of the 26th conference on Winter simulation
Empirical measurements of overheads in conservative asynchronous simulations
ACM Transactions on Modeling and Computer Simulation (TOMACS)
Analysis of bounded time warp and comparison with YAWNS
ACM Transactions on Modeling and Computer Simulation (TOMACS)
Parallel and distributed discrete event simulation: algorithms and applications
WSC '93 Proceedings of the 25th conference on Winter simulation
A testbed for parallel simulation performance prediction
WSC '96 Proceedings of the 28th conference on Winter simulation
Performance analysis of time warp simulation with cascading rollbacks
PADS '98 Proceedings of the twelfth workshop on Parallel and distributed simulation
Trade-Off between Sequential and Time Warp-Based Parallel Simulation
IEEE Transactions on Parallel and Distributed Systems
Partitioning WCN models for parallel simulation of radio resource management
Wireless Networks - Special issue: Design and modeling in mobile and wireless systsems
Data mining for simulation algorithm selection
Proceedings of the 2nd International Conference on Simulation Tools and Techniques
Experimental analysis of logical process simulation algorithms in JAMES II
Winter Simulation Conference
Clustering in stochastic asynchronous algorithms for distributed simulations
SAGA'05 Proceedings of the Third international conference on StochasticAlgorithms: foundations and applications
On the parallel simulation of scale-free networks
Proceedings of the 2013 ACM SIGSIM conference on Principles of advanced discrete simulation
| 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 (or processors) are analyzed under the following assumptions: exponential task times and timestamp 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. Several performance measures are determined, such as: 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, the probability distribution function for the virtual time of a process, and the fraction of time the processors remain idle. The analysis is approximate, thus the results have been validated through performance measurements of a Time Warp testbed executing on a shared-memory multiprocessor.