ACM Transactions on Programming Languages and Systems (TOPLAS)
Parallel discrete event simulation
WSC '89 Proceedings of the 21st conference on Winter simulation
Low copy message passing on the Alliant CAMPUS/800
Proceedings of the 1992 ACM/IEEE conference on Supercomputing
MPI: a message passing interface
Proceedings of the 1993 ACM/IEEE conference on Supercomputing
Automatic incremental state saving
PADS '96 Proceedings of the tenth workshop on Parallel and distributed simulation
Efficient optimistic parallel simulations using reverse computation
ACM Transactions on Modeling and Computer Simulation (TOMACS)
Large-Scale TCP Models Using Optimistic Parallel Simulation
Proceedings of the seventeenth workshop on Parallel and distributed simulation
Optimistic Parallel Discrete Event Simulations of Physical Systems Using Reverse Computation
Proceedings of the 19th Workshop on Principles of Advanced and Distributed Simulation
Proceedings of the 21st International Workshop on Principles of Advanced and Distributed Simulation
Parallel Vehicular Traffic Simulation using Reverse Computation-based Optimistic Execution
Proceedings of the 22nd Workshop on Principles of Advanced and Distributed Simulation
Hardware Supported Time Synchronization in Multi-core Architectures
PADS '09 Proceedings of the 2009 ACM/IEEE/SCS 23rd Workshop on Principles of Advanced and Distributed Simulation
| Hi-index | 0.00 |
We present a new Zero-Copy approach for message passing in a tightly coupled, multi -- process parallel discrete event simulation. Our approach is highly scalable and is suited for large scale distributed simulations. A Zero-Copy approach never copies message content. Rather, messages are created initially in a shared -- memory region, and only a smart pointer referring to the shared memory object is passed to a message recipient. The smart pointer can be dereferenced normally, and has reference count semantics allowing memory reuse when no references remain. This approach significantly reduces the amount of data copied between processes and results in considerable improvement in overall application performance as compared to more traditional shared --memory based message passing. We demonstrate the efficiency of our approach using two distributed discrete event simulators using conservative synchronization. However, we also included knowledge of the Global Virtual Time and the Current Simulation Time in our memory management algorithms, allowing rollbacks and reclaiming of memory that was freed prematurely.