基于并行仿真的MTBA算法研究

The Research of the Minimum Time Buckets Algorithm Based on Parallel Simulation

混合策略在一定程度上避免了过分保守或极端乐观的缺点。本文首先分析了现有同步机制存在的不足,然后论述了视界概念及最小时间桶算法的设计与实现,接着对最小时间桶算法的性能进行了定性定量的深入探讨,最后采用PHOLD仿真应用模型在MTBA算法、保守算法和TW乐观算法之间进行了性能对比实验。实验结果表明,MTBA算法在某些条件下具有更小的回退开销和更快的事件处理效率。

Hybrid strategy to some certain extent avoids the shortcomings of the excessive conservation and extremely optimism. This paper begins with the discussion the shortcoming of the existing time synchronization algorithms; then it briefly presents the very important conception of the event horizon, furthermore, it put forward the design and the realization of the Minimum Time Buckets Algorithm; The remainder of this paper provides the farther research for the performance of this algorithm by qualitative analysis and quantitative analysis; Finally we use the PHOLD simulation model to compare the performance of conservative algorithm, TW algorithm and MTBA algorithm. The experiment results indicate that under some conditions MTBA algorithm has lower rollback costs and faster event process speed, which lead to better performance than TW and conservative algorithms.