ACM Transactions on Programming Languages and Systems (TOPLAS)
SOSP '87 Proceedings of the eleventh ACM Symposium on Operating systems principles
Time warp on a shared memory multiprocessor
Transactions of the Society for Computer Simulation International
An algorithm for minimally latent global virtual time
PADS '93 Proceedings of the seventh workshop on Parallel and distributed simulation
Efficient algorithms for distributed snapshots and global virtual time approximation
Journal of Parallel and Distributed Computing - Special issue on parallel and discrete event simulation
pGVT: an algorithm for accurate GVT estimation
PADS '94 Proceedings of the eighth workshop on Parallel and distributed simulation
GTW: a time warp system for shared memory multiprocessors
WSC '94 Proceedings of the 26th conference on Winter simulation
A case study in simulating PCS networks using Time Warp
PADS '95 Proceedings of the ninth workshop on Parallel and distributed simulation
Global Virtual Time and distributed synchronization
PADS '95 Proceedings of the ninth workshop on Parallel and distributed simulation
A fast asynchronous GVT algorithm for shared memory multiprocessor architectures
PADS '95 Proceedings of the ninth workshop on Parallel and distributed simulation
ParaSol: a multithreaded system for parallel simulation based on mobile threads
WSC '95 Proceedings of the 27th conference on Winter simulation
Concurrency preserving partitioning (CPP) for parallel logic simulation
PADS '96 Proceedings of the tenth workshop on Parallel and distributed simulation
Non-interfering GVT computation via asynchronous global reductions
WSC '93 Proceedings of the 25th conference on Winter simulation
Computing global virtual time in shared-memory multiprocessors
ACM Transactions on Modeling and Computer Simulation (TOMACS)
ROSS: a high-performance, low memory, modular time warp system
PADS '00 Proceedings of the fourteenth workshop on Parallel and distributed simulation
Efficient optimistic parallel simulations using reverse computation
ACM Transactions on Modeling and Computer Simulation (TOMACS)
Virtual time synchronization over unreliable network transport
Proceedings of the fifteenth workshop on Parallel and distributed simulation
Pal: a new fossil collector for time warp
Proceedings of the sixteenth workshop on Parallel and distributed simulation
Redesigning the WARPED Simulation Kernel for Analysis and Application Development
ANSS '03 Proceedings of the 36th annual symposium on Simulation
A hypercube algorithm for GVT computation and its application in optimistic parallel simulation
SS '95 Proceedings of the 28th Annual Simulation Symposium
Parallel and distributed simulation: traditional techniques and recent advances
Proceedings of the 38th conference on Winter simulation
Scaling time warp-based discrete event execution to 104 processors on a Blue Gene supercomputer
Proceedings of the 4th international conference on Computing frontiers
Macro-Micro Economic System Simulation
Proceedings of the 21st International Workshop on Principles of Advanced and Distributed Simulation
Dynamic entity distribution in parallel discrete event simulation
Proceedings of the 40th Conference on Winter Simulation
Experimental analysis of logical process simulation algorithms in JAMES II
Winter Simulation Conference
Exploring spatial partition for parallel simulation of DEVS-FIRE
SCSC '09 Proceedings of the 2009 Summer Computer Simulation Conference
Parallel discrete event simulation with Erlang
Proceedings of the 1st ACM SIGPLAN workshop on Functional high-performance computing
Investigating the memory characteristics of a massively parallel time warp kernel
Proceedings of the Winter Simulation Conference
Warp speed: executing time warp on 1,966,080 cores
Proceedings of the 2013 ACM SIGSIM conference on Principles of advanced discrete simulation
| Hi-index | 0.00 |
This paper presents the design, implementation and performance of a Time Warp simulator, called DSIM, which targets clusters comprised of thousands of processors. DSIM employs a novel technique for GVT computation, called the Time Quantum GVT algorithm that requires no message acknowledgement, relies on constant-length messages and is efficient on clusters with large numbers of processors. Its implementation uses a technique called Local Fossil Collection to alleviate the overhead of memory reclamation and to support efficient event management. DSIM is also equipped with a simple programming interface to ease programming and debugging of simulations. Experimental results obtained on the PHOLD benchmark demonstrated that DSIM can process as many as 228 million events per second on 1033 processors.