## 摘要

This paper derives a relationship between a conservative optimal simulation and the 'Time Warp' or 'optimistic' parallel simulation, and compares the performance of the Time Warp simulation with Chandy-Misra conservative simulation. We show that Time Warp simulation with aggressive cancellation is not conservative optimal in general, even under the assumption that the operational overhead virt is 0. We derive a sufficient condition for Time Warp to be conservative optimal and show some simulation problems that meet this condition (referred to as Time Warp simulations that satisfy the sufficient conservative optimal condition, or TWSO.) We show that by applying the lazy cancellation technique to TWSO, Time Warp always outperforms a conservative optimal simulation. Given equivalently favorable assumptions for both the Time Warp approach and the Chandy-Misra approach, we show that the Time Warp approach outperforms the Chandy-Misra approach in every feedforward network simulation. For feedback networks without lookahead, we show that in most cases Time Warp outperforms Chandy-Misra.

原文 | English |
---|---|

頁（從 - 到） | 29-34 |

頁數 | 6 |

期刊 | Simulation Series |

卷 | 22 |

發行號 | 1 |

出版狀態 | Published - 1月 1990 |

事件 | Proceedings of the SCS Multiconference on Distributed Simulation - San Diego, CA, USA 持續時間: 17 1月 1990 → 19 1月 1990 |