ACM Transactions on Programming Languages and Systems (TOPLAS)
Performance analysis of synchronization for two communicating processes
Performance Evaluation
Parallel discrete event simulation
Communications of the ACM - Special issue on simulation
PVM: a framework for parallel distributed computing
Concurrency: Practice and Experience
Performance bounds on parallel self-initiating discrete-event simulations
ACM Transactions on Modeling and Computer Simulation (TOMACS)
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
Design and Evaluation of the Rollback Chip: Special Purpose Hardware for Time Warp
IEEE Transactions on Computers
Selecting the checkpoint interval in time warp simulation
PADS '93 Proceedings of the seventh workshop on Parallel and distributed simulation
An analytical comparison of periodic checkpointing and incremental state saving
PADS '93 Proceedings of the seventh workshop on Parallel and distributed simulation
Synchronous relaxation for parallel simulations with applications to circuit-switched networks
ACM Transactions on Modeling and Computer Simulation (TOMACS)
Mathematical foundations for time warp systems
ACM Transactions on Programming Languages and Systems (TOPLAS)
Parallel simulation using conservative time windows
WSC '92 Proceedings of the 24th conference on Winter simulation
Adaptive checkpointing in Time Warp
PADS '94 Proceedings of the eighth workshop on Parallel and distributed simulation
A Parallelism Analyzer for Conservative Parallel Simulation
IEEE Transactions on Parallel and Distributed Systems
Probabilistic adaptive direct optimism control in Time Warp
PADS '95 Proceedings of the ninth workshop on Parallel and distributed simulation
Analysis of bounded time warp and comparison with YAWNS
ACM Transactions on Modeling and Computer Simulation (TOMACS)
An external state management system for optimistic parallel simulation
WSC '93 Proceedings of the 25th conference on Winter simulation
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
On Process Migration and Load Balancing in Time Warp
IEEE Transactions on Parallel and Distributed Systems
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
A large scale, homogeneous, fully distributed parallel machine, I
ISCA '77 Proceedings of the 4th annual symposium on Computer architecture
Estimating rollback overhead for optimism control in Time Warp
SS '95 Proceedings of the 28th Annual Simulation Symposium
A Dynamic Load Balancing Architecture for PDES Using PVM on Clusters
Proceedings of the 8th European PVM/MPI Users' Group Meeting on Recent Advances in Parallel Virtual Machine and Message Passing Interface
Predicting the Performance of Synchronous Discrete Event Simulation
IEEE Transactions on Parallel and Distributed Systems
Hi-index | 0.00 |
Discrete event simulation is a methodology to study the behavior of complex systems. Its drawback is that, in order to get reliable results, simulations usually have to be run over a long stretch of time. This time requirement could decrease through the usage of parallel or distributed computing systems. In this paper, we analyze the Time Warp synchronization protocol for parallel discrete event simulation and present an analytical model evaluating the upper bound on the completion time of a Time Warp simulation. In our analysis, we consider the case of a simulation model with homogeneous logical processes, where 驴homogeneous驴 means they have the same average event routine time and the same state saving cost. Then we propose a methodology to determine when it is time-convenient to use a Time Warp synchronized simulation, instead of a sequential one, for a simulation model with features matching those considered in our analysis. We give an answer to this question without the need to preliminary generate the simulation code. Examples of methodology usage are reported for the case of both a synthetic benchmark and a real world model.