ACM Transactions on Programming Languages and Systems (TOPLAS)
Performance evaluation of the time warp distributed simulation mechanism
Performance evaluation of the time warp distributed simulation mechanism
SOSP '87 Proceedings of the eleventh ACM Symposium on Operating systems principles
Design and performance of special purpose hardware for time warp
ISCA '88 Proceedings of the 15th Annual International Symposium on Computer architecture
Parallel simulation of queueing networks: limitations and potentials
SIGMETRICS '89 Proceedings of the 1989 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
The object library for parallel simulation (OLPS)
WSC '88 Proceedings of the 20th conference on Winter simulation
Exploiting Lookahead in Parallel Simulation
IEEE Transactions on Parallel and Distributed Systems
A Study and Analysis of Performance of Distributed Simulation
A Study and Analysis of Performance of Distributed Simulation
Optimal memory management for time warp parallel simulation
ACM Transactions on Modeling and Computer Simulation (TOMACS) - Special issue on parallel and distributed systems performance
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
State of the art in parallel simulation
WSC '92 Proceedings of the 24th conference on Winter simulation
Understanding supercritical speedup
PADS '94 Proceedings of the eighth workshop on Parallel and distributed simulation
An evaluation system for distributed-time VHDL simulation
PADS '94 Proceedings of the eighth workshop on Parallel and distributed simulation
PADS '95 Proceedings of the ninth workshop on Parallel and distributed simulation
Knowledge-based distributed simulation generator
ANSS '92 Proceedings of the 25th annual symposium on Simulation
Simulating spatially explicit problems on high performance architectures
Journal of Parallel and Distributed Computing - Parallel and Distributed Discrete Event Simulation--An Emerging Technology
Distributed Simulation of Petri Nets
IEEE Parallel & Distributed Technology: Systems & Technology
External Adjustment of Runtime Parameters in Time Warp Synchronized Parallel Simulators
IPPS '97 Proceedings of the 11th International Symposium on Parallel Processing
Performance Comparable Design of Efficient Synchronization Protocols for Distributed Simulation
MASCOTS '95 Proceedings of the 3rd International Workshop on Modeling, Analysis, and Simulation of Computer and Telecommunication Systems
On consistency and network latency in distributed interactive applications: a survey--part I
Presence: Teleoperators and Virtual Environments
The implementation and evaluation of a recovery system for workflows
Journal of Network and Computer Applications
DS-RT '08 Proceedings of the 2008 12th IEEE/ACM International Symposium on Distributed Simulation and Real-Time Applications
On mixed abstraction, languages, and simulation approach to refinement with systemC AMS
EURASIP Journal on Embedded Systems - Special issue on design methodologies and innovative architectures for mixed-signal embedded systems
Proceedings of the ACM 2011 conference on Computer supported cooperative work
A dead-lock free self-healing algorithm for distributed transactional processes
ICISS'06 Proceedings of the Second international conference on Information Systems Security
| Hi-index | 0.00 |
The Time Warp “optimistic” approach is one of the most important parallel simulation protocols. Time Warp synchronizes processes via rollback. The original rollback mechanism called lazy cancellation has aroused great interest. This paper studies these rollback mechanisms. The general tradeoffs between aggressive and lazy cancellation are discussed, and by a conservitive-optimal simulation is defined for comparitive purposes. Within the framework of aggressive cancellation, we offer some observations and analyze the rollback behavior of tandom systems. The lazy cancellation mechanism iss examined using a metric called the sensitivity of output message. Both aggressive and lazy cancellation are shown to work well for a process with a small simulated load intensity. Finally, an analytical model is given to analyze message preemtion, an important factor that affects the performance of rollback mechanisms. Results indicate that message preemtion has a significant effect on performance when (1) the processor is highly utilized, (2) the execution times of messages have high varience, and (3) rollbacks occur frequently.