• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文期刊>IEEE Transactions on Parallel and Distributed Systems >A timeout-based message ordering protocol for a lightweight software implementation of TMR systems
【24h】

A timeout-based message ordering protocol for a lightweight software implementation of TMR systems

机译：基于超时的消息排序协议，用于TMR系统的轻量级软件实现

获取原文
获取原文并翻译 | 示例
           
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

Replicated processing with majority voting is a well-known method for achieving reliability and availability. Triple modular redundant (TMR) processing is the most commonly used version of that method. Replicated processing requires that the replicas reach agreement on the order in which input requests are to be processed. Almost all synchronous and deterministic ordering protocols published in the literature are time-based in the sense that they require replicas' clocks to be kept synchronized within some known bound. We present a protocol for TMR systems that is based on timeouts and does not require clocks to be kept in bounded synchronism. Our design efforts focus on keeping the ordering delays small, without an unnecessary increase in message overhead. Consequently, we are able to show that no symmetric protocol that works only with unsynchronized clocks can provide a smaller worst-case delay. We also demonstrate through analysis and experiments that our protocol is faster than a time-based one of identical message complexity in certain situations which can prevail in many application settings.
机译：具有多数表决权的复制处理是一种实现可靠性和可用性的众所周知的方法。三重模块冗余（TMR）处理是该方法的最常用版本。复制处理要求复制品就输入请求的处理顺序达成一致。文献中公布的几乎所有同步和确定性排序协议都是基于时间的，因为它们要求副本的时钟在某个已知范围内保持同步。我们提出了一种用于TMR系统的协议，该协议基于超时，并且不需要时钟保持有界同步。我们的设计工作着眼于使订购延迟较小，而不会不必要地增加消息开销。因此，我们能够证明，仅适用于非同步时钟的对称协议无法提供更小的最坏情况延迟。通过分析和实验，我们还证明，在某些情况下，我们的协议比基于时间的相同消息复杂度更快，这在许多应用程序设置中都很普遍。

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号