ACM Transactions on Programming Languages and Systems (TOPLAS)
Virtual time II: storage management in conservative and optimistic systems
PODC '90 Proceedings of the ninth 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
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
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
A performance study of the cancelback protocol for Time Warp
PADS '93 Proceedings of the seventh workshop on Parallel and distributed simulation
An adaptive memory management protocol for Time Warp parallel simulation
SIGMETRICS '94 Proceedings of the 1994 ACM SIGMETRICS conference on Measurement and modeling of computer systems
Effects of the checkpoint interval on time and space in time warp
ACM Transactions on Modeling and Computer Simulation (TOMACS)
High performance parallelized discrete event simulation of stochastic queueing networks
WSC '88 Proceedings of the 20th conference on Winter simulation
Transparent incremental state saving in time warp parallel discrete event simulation
PADS '96 Proceedings of the tenth workshop on Parallel and distributed simulation
An Empirical Evaluation of Performance-Memory Trade-Offs in Time Warp
IEEE Transactions on Parallel and Distributed Systems
PADS '98 Proceedings of the twelfth workshop on Parallel and distributed simulation
Parallel and distributed simulation
Proceedings of the 31st conference on Winter simulation: Simulation---a bridge to the future - Volume 1
Parallel simulation: parallel and distributed simulation systems
Proceedings of the 33nd conference on Winter simulation
Parallel simulation: distributed simulation systems
Proceedings of the 35th conference on Winter simulation: driving innovation
Optimistic Parallel Discrete Event Simulations of Physical Systems Using Reverse Computation
Proceedings of the 19th Workshop on Principles of Advanced and Distributed Simulation
DS-RT '08 Proceedings of the 2008 12th IEEE/ACM International Symposium on Distributed Simulation and Real-Time Applications
Optimistic Parallel Simulation over Public Resource-Computing Infrastructures and Desktop Grids
DS-RT '08 Proceedings of the 2008 12th IEEE/ACM International Symposium on Distributed Simulation and Real-Time Applications
Hi-index | 0.00 |
This paper examines memory management issues associated with Time Warp synchronized parallel simulation on distributed memory machines. The paper begins with a summary of the techniques which have been previously proposed for memory management on various parallel processor memory structures. It then concentrates the discussion on parallel simulation executing on a distributed memory computer—a system comprised of separate computers, interconnected by a communications network. An important characteristic of the software developed for such systems is the fact that the dynamic memory is allocated from a pool of memory that is shared by all of the processes at a given processor.This paper presents a new memory management protocol, pruneback, which recovers space by discarding previous states. This is different from all previous schemes such as artificial rollback and cancelback which recover memory space by causing one or more logical processes to roll back to an earlier simulation time.The paper includes an empirical study of a parallel simulation of a closed stochastic queueing network showing the relationship between simulation execution time and amount of memory available. The results indicate that using pruneback is significantly more effective than artificial rollback (adapted for a distributed memory computer) for this problem. In the study, varying the memory limits over a 2:1 range resulted in a 1:2 change in artificial rollback execution time and almost no change in pruneback execution time.