【24h】

Run-Time Switching Between Total Order Algorithms

机译:总订单算法之间的运行时切换

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

摘要

Total order broadcast protocols are a fundamental building block in the construction of many fault-tolerant distributed applications. Unfortunately, total order is an intrinsically expensive operation. Moreover, there are certain algorithms that perform better in specific scenarios and given network properties. This paper proposes and evaluates an adaptive protocol that is able to dynamically switch between different total order algorithms. The protocol allows to achieve the best possible performance, by selecting, in each moment, the algorithm that is most appropriate to the present network conditions. Experimental results show that, using our protocol, adaptation can be achieved with negligible interference with the data flow.
机译:总订单广播协议是许多容错分布式应用程序构建中的基本构建块。不幸的是,总订单本质上是一项昂贵的操作。而且,某些算法在特定情况下和给定的网络属性下性能更好。本文提出并评估了一种自适应协议,该协议能够在不同的总阶算法之间动态切换。通过在每时每刻选择最适合当前网络状况的算法,该协议可以实现最佳性能。实验结果表明,使用我们的协议,可以在对数据流产生微不足道的干扰的情况下实现自适应。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号