ACM Transactions on Programming Languages and Systems (TOPLAS)
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
Virtual time II: storage management in conservative and optimistic systems
PODC '90 Proceedings of the ninth annual ACM symposium on Principles of distributed computing
Performance bounds on parallel self-initiating discrete-event simulations
ACM Transactions on Modeling and Computer Simulation (TOMACS)
An analysis of rollback-based simulation
ACM Transactions on Modeling and Computer Simulation (TOMACS)
Performance Analysis of Time Warp with Multiple Homogeneous Processors
IEEE Transactions on Software Engineering
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
Optimal memory management for time warp parallel simulation
ACM Transactions on Modeling and Computer Simulation (TOMACS) - Special issue on parallel and distributed systems performance
A performance study of the cancelback protocol for Time Warp
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
Memory management techniques for Time Warp on a distributed memory machine
PADS '95 Proceedings of the ninth workshop on Parallel and distributed simulation
Prediction of memory consumption in conservative parallel simulation
PADS '95 Proceedings of the ninth workshop on Parallel and distributed simulation
Clustering in stochastic asynchronous algorithms for distributed simulations
SAGA'05 Proceedings of the Third international conference on StochasticAlgorithms: foundations and applications
| Hi-index | 0.00 |
The behavior of n interacting processes synchronized by the “Time Warp” rollback mechanism is analyzed under the constraint that the total amount of memory to execute the program is limited. In Time Warp, a protocol called “cancelback” has been proposed to reclaim storage when the system runs out of memory. A discrete state, continuous time Markov chain model for Time Warp augmented with the cancelback protocol is developed for a shared memory system with n homogeneous processors and homogeneous workload. The model allows one to predict speedup as the amount of available memory is varied. To our knowledge, this is the first model to achieve this result. The performance predicted by the model is validated through direct performance measurements on an operational Time Warp system executing on a shared-memory multiprocessor using a workload similar to that in the model. It is observed that Time Warp with only a few additional message buffers per processor over that required in the corresponding sequential execution can achieve approximately the same or even greater performance than Time Warp with unlimited memory, if GVT computation and fossil collection can be efficiently implemented.