首页> 外文期刊>IEEE Transactions on Parallel and Distributed Systems >Theoretical analysis for communication-induced checkpointing protocols with rollback-dependency trackability
【24h】

Theoretical analysis for communication-induced checkpointing protocols with rollback-dependency trackability

机译:具有回滚相关性可追踪性的通信诱发检查点协议的理论分析

获取原文
获取原文并翻译 | 示例
           

摘要

Rollback-Dependency Trackability (RDT) is a property that states that all rollback dependencies between local checkpoints are on-line trackable by using a transitive dependency vector. In this paper, we address three fundamental issues in the design of communication-induced checkpointing protocols that ensure RDT. First, we prove that the following intuition commonly assumed in the literature is in fact false: If a protocol forces a checkpoint only at a stronger condition, then it must take, at most, as many forced checkpoints as a protocol based on a weaker condition. This result implies that the common approach of sharpening the checkpoint-inducing condition by piggybacking more control information on each message may not always yield a more efficient protocol. Next, we prove that there is no optimal on-line RDT protocol that takes fewer forced checkpoints than any other RDT protocol for all possible communication patterns. Finally, since comparing checkpoint-inducing conditions is not sufficient for comparing protocol performance, we present some formal techniques for comparing the performance of several existing RDT protocols.
机译:回滚依赖关系可跟踪性(RDT)是一项属性,该属性指出本地检查点之间的所有回滚依赖关系都可以通过使用传递依赖关系矢量进行在线跟踪。在本文中,我们解决了确保RDT的通信诱发检查点协议设计中的三个基本问题。首先,我们证明文献中通常假定的以下直觉实际上是错误的:如果协议仅在更强的条件下强制执行检查点,则它最多必须与基于较弱条件的协议所采用的强制检查点一样多。该结果表明,通过在每个消息上附加更多控制信息来增强检查点诱导条件的通用方法可能并不总是产生更有效的协议。接下来,我们证明对于所有可能的通信模式,没有比任何其他RDT协议花费更少的强制检查点的最佳在线RDT协议。最后,由于比较检查点引发条件不足以比较协议性能,因此我们提出了一些正式的技术来比较几种现有RDT协议的性能。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号