ACM Transactions on Programming Languages and Systems (TOPLAS)
Computer networks
Rollback sometimes works...if filtered
WSC '89 Proceedings of the 21st conference on Winter simulation
Limitation of optimism in the time warp operating system
WSC '89 Proceedings of the 21st conference on Winter simulation
Parallel discrete event simulation
Communications of the ACM - Special issue on simulation
Virtual time II: storage management in conservative and optimistic systems
PODC '90 Proceedings of the ninth annual ACM symposium on Principles of distributed computing
Computer and communication systems performance modelling
Computer and communication systems performance modelling
PADS '93 Proceedings of the seventh workshop on Parallel and distributed simulation
The local Time Warp approach to parallel simulation
PADS '93 Proceedings of the seventh workshop on Parallel and distributed simulation
Performance of a riskfree Time Warp operating system
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
Parallel and distributed simulation of discrete event systems
Parallel and distributed simulation of discrete event systems
Scheduling time warp processes using adaptive control techniques
WSC '94 Proceedings of the 26th conference on Winter simulation
Probabilistic adaptive direct optimism control in Time Warp
PADS '95 Proceedings of the ninth workshop on Parallel and distributed simulation
Buffer management in shared-memory Time Warp systems
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
NPSI adaptive synchronization algorithms for PDES
WSC '95 Proceedings of the 27th conference on Winter simulation
Wolf: a rollback algorithm for optimistic distributed simulation systems
WSC '88 Proceedings of the 20th conference on Winter simulation
Estimating rollback overhead for optimism control in Time Warp
SS '95 Proceedings of the 28th Annual Simulation Symposium
A probabilistic event scheduling policy for optimistic parallel discrete event simulation
PADS '98 Proceedings of the twelfth workshop on Parallel and distributed simulation
On learning algorithms and balancing loads in Time Warp
PADS '99 Proceedings of the thirteenth workshop on Parallel and distributed simulation
Optimistic parallel simulation over a network of workstations
Proceedings of the 31st conference on Winter simulation: Simulation---a bridge to the future - Volume 2
Efficient Execution of Time Warp Programs on Heterogeneous, NOW Platforms
IEEE Transactions on Parallel and Distributed Systems
Slow memory: the rising cost of optimism
PADS '00 Proceedings of the fourteenth workshop on Parallel and distributed simulation
An empirical study of conservative scheduling
PADS '00 Proceedings of the fourteenth workshop on Parallel and distributed simulation
On Rolling Back and Checkpointing in Time Warp
IEEE Transactions on Parallel and Distributed Systems
Optimizing time warp simulation with reinforcement learning techniques
Proceedings of the 39th conference on Winter simulation: 40 years! The best is yet to come
Scalable Time Warp on Blue Gene Supercomputers
PADS '09 Proceedings of the 2009 ACM/IEEE/SCS 23rd Workshop on Principles of Advanced and Distributed Simulation
SpringSim '09 Proceedings of the 2009 Spring Simulation Multiconference
Using genetic algorithms to limit the optimism in time warp
Winter Simulation Conference
Approximate parallel simulation of web search engines
Proceedings of the 2013 ACM SIGSIM conference on Principles of advanced discrete simulation
Accelerating optimistic HLA-based simulations in virtual execution environments
Proceedings of the 2013 ACM SIGSIM conference on Principles of advanced discrete simulation
| Hi-index | 0.00 |
It is well known that Time Warp may suffer from poor performance due to excessive rollbacks caused by overly optimistic execution. Here we present a simple flow control mechanism using only local information and GVT that limits the number of uncommitted messages generated by a processor, thus throttling overly optimistic TW execution. The flow control scheme is analogous to traditional networking flow control mechanisms. A ``window'' of messages defines the maximum number of uncommitted messages allowed to be scheduled by a process. Committing messages is analogous to acknowledgments in networking flow control. The initial size of the window is calculated using a simple analytical model that estimates the instantaneous number of messages that a process will eventually commit. This window is expanded so that the process may progress up to the next commit point (generally the next fossil collection), and to accommodate optimistic execution. The expansions to the window are based on monitoring TW performance statistics so the window size automatically adapts to changing program behaviors.The flow control technique presented here is simple and fully automatic. No global knowledge or synchronization (other than GVT) is required. We also develop an implementation of the flow control scheme for shared memory multiprocessors that uses dynamically sized pools of free message buffers. Experimental data indicates that the adaptive flow control scheme maintains high performance for "balanced workloads'', and achieves as much as a factor of 7 speedup over unthrottled TW for certain irregular workloads.