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
Actor based parallel VHDL simulation using time warp
PADS '96 Proceedings of the tenth workshop on Parallel and distributed simulation
Experiences in verifying parallel simulation algorithms
FMSP '98 Proceedings of the second workshop on Formal methods in software practice
Using Programmable NICs for Time-Warp Optimization
IPDPS '02 Proceedings of the 16th International Parallel and Distributed Processing Symposium
External Adjustment of Runtime Parameters in Time Warp Synchronized Parallel Simulators
IPPS '97 Proceedings of the 11th International Symposium on Parallel Processing
Redesigning the WARPED Simulation Kernel for Analysis and Application Development
ANSS '03 Proceedings of the 36th annual symposium on Simulation
Proceedings of the 35th conference on Winter simulation: driving innovation
Seven-O'Clock: A New Distributed GVT Algorithm Using Network Atomic Operations
Proceedings of the 19th Workshop on Principles of Advanced and Distributed Simulation
A visual environment for distributed simulation systems
ACM SIGSIM Simulation Digest
DSIM: scaling time warp to 1,033 processors
WSC '05 Proceedings of the 37th conference on Winter simulation
Causality information and fossil collection in timewarp simulations
Proceedings of the 38th conference on Winter simulation
A use of matrix with GVT computation in optimistic time warp algorithm for parallel simulation
Proceedings of the 15th Communications and Networking Simulation Symposium
On deciding between conservative and optimistic approaches on massively parallel platforms
Proceedings of the Winter Simulation Conference
| Hi-index | 0.00 |
The time warp mechanism uses memory space to save event and state information for rollback processing. As the simulation advances in time, old state and event information can be discarded and the memory space reclaimed. This reclamation process is called fossil collection and is guided by a global time value called Global Virtual Time (GVT). That is, GVT represents the greatest minimum time of the fully committed events (the time before which no rollback will occur). GVT is then used to establish a boundary for fossil collection. This paper presents a new algorithm for GVT estimation called pGVT. pGVT was designed to support accurate estimates of the actual GVT value and it operates in an environment where the communication subsystem does not support FIFO message delivery and where message delivery failure may occur. We show that pGVT correctly estimates GVT values and present some performance comparisons with other GVT algorithms.