首页> 外文会议>International symposium on distributed computing >OFC: A Distributed Fossil-Collection Algorithm for Time-Warp
【24h】

OFC: A Distributed Fossil-Collection Algorithm for Time-Warp

机译:OFC:用于时间扭曲的分布式化石收集算法

获取原文

摘要

In the Time-Warp synchronization model, the processes must occasionally interrupt execution in order to reclaim memory space used by state and event histories that are no longer needed (fossil-collection). Traditionally, fossil-collection techniques have required the processes to reach a consensus on the Global Virtual-Time (GVT) - the global progress time. Events with time-stamps less than GVT are guaranteed to have been processed correctly; their histories can be safely collected. This paper presents Optimistic Fossil-Collection (OFC), a new fossilcollection algorithm that is fully distributed. OFC uses a local decision function to estimate the fossilized portion of the histories (and optimistically collects them). Because a global property is estimated using local information only, an erroneous estimate is possible. Accordingly, OFC must also include a recovery mechanism to be feasible. An uncoordinated distributed checkpointing algorithm for Time-Warp that is domino-effect free and lighweight is used. We show that, in addition to eliminating the overhead for GVT estimation, OFC has several desireable memory-management properties.
机译:在时间扭曲同步模型中,进程必须偶尔中断执行,以便回收不再需要的状态和事件历史(Fossil-Collection)使用的内存空间。传统上,化石收集技术要求流程在全球虚拟时间(GVT)上达成共识 - 全局进度时间。保证与GVT小于GVT的活动的事件已正确处理;他们的历史可以安全收集。本文介绍了乐观化石收集(OFC),这是一种完全分布的新化石校集算法。 OFC使用局部决策功能来估计历史的僵化部分(并乐观地收集它们)。因为仅使用本地信息估计全局属性,所以可能是可能的错误估计。因此,OFC还必须包括恢复机制可行。使用了一个不协调的分布式检查点算法,用于Domino-Effect Free和Lighpeight。我们表明,除了消除GVT估计的开销之外,OFC还具有若干灵敏的内存管理属性。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号