PADS '93 Proceedings of the seventh workshop on Parallel and distributed simulation
The MIMDIX environment for parallel simulation
Journal of Parallel and Distributed Computing - Special issue on parallel and discrete event simulation
Adaptive memory management and optimism control in time warp
ACM Transactions on Modeling and Computer Simulation (TOMACS)
Speculative parallel simulation with an adaptive throttle scheme
Proceedings of the eleventh workshop on Parallel and distributed simulation
Combining optimism limiting schemes in time warp based parallel simulations
Proceedings of the 30th conference on Winter simulation
Wolf: a rollback algorithm for optimistic distributed simulation systems
WSC '88 Proceedings of the 20th conference on Winter simulation
The dependence list in time warp
Proceedings of the fifteenth workshop on Parallel and distributed simulation
Causality representation and cancellation mechanism in time warp simulations
Proceedings of the fifteenth workshop on Parallel and distributed simulation
Parallel and Distribution Simulation Systems
Parallel and Distribution Simulation Systems
Early cancellation: an active NIC optimization for time-warp
Proceedings of the sixteenth workshop on Parallel and distributed simulation
Batch based cancellation: a rollback optimal cancellation scheme in time warp simulations
Proceedings of the eighteenth workshop on Parallel and distributed simulation
PADS '09 Proceedings of the 2009 ACM/IEEE/SCS 23rd Workshop on Principles of Advanced and Distributed Simulation
| Hi-index | 0.00 |
Time Warp parallel simulations need efficient schemes to cancel erroneous event messages in order to achieve acceptable performance levels. Lazy cancellation depends on delaying the cancellation of incorrect computations until rolled-back events are re-processed. An antimessage is then sent for cancellation only if an output message re-produced after rollback is found to be unequal to its counterpart produced before rollback. One drawback of this approach is that antimessages are sent too late to catch the wave of incorrect computations, which results in more rollbacks. In this paper, we suggest an enhanced lazy cancellation technique that aims to throttle incorrect computations. It asks logical processes (LPs) that have received any output messages, generated from the first execution of a rolled-back input event in some neighboring LP, to mark those messages as temporarily blocked. Those messages remain in a blocked state until it is later decided whether or not they must be cancelled. The receiving LP becomes blocked only after a blocked input message becomes the next message to process. After re-executing the rolled-back input event, the sending LP sends each of its receiving LPs either an `Unblock' message or an antimessage for each previously marked output message, depending on the result of the equality test of that output message's versions before and after rollback. Experimental results for a synthetic benchmark show that our technique can yield better performance than both lazy and aggressive cancellation.