首页> 外文期刊>IEEE Transactions on Parallel and Distributed Systems >Performance of the optimal causal multicast algorithm: a statistical analysis
【24h】

Performance of the optimal causal multicast algorithm: a statistical analysis

机译:最佳因果组播算法的性能:统计分析

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

摘要

An optimal causal message ordering algorithm for asynchronous distributed systems was proposed by Kshemkalyani and Singhal and its optimality was proven theoretically. For a system of n processes, although the space complexity of this algorithm was shown to be O(n/sup 2/) integers, it was expected that the actual space overhead would be much less than n/sup 2/. It is difficult to determine the behavior of this algorithm by a theoretical analysis. We measure the overheads of two different implementations of the optimal causal message ordering algorithm via simulation under a wide range of system conditions. The optimal algorithm is seen to display significantly less message space overhead and log space overhead than the canonical Raynal-Schiper-Toueg algorithm.
机译:Kshemkalyani和Singhal提出了一种用于异步分布式系统的最优因果消息排序算法,并从理论上证明了其最优性。对于n个进程的系统,尽管该算法的空间复杂度显示为O(n / sup 2 /)整数,但可以预期实际空间开销将远远小于n / sup 2 /。通过理论分析很难确定该算法的行为。我们通过在广泛的系统条件下进行仿真,来测量最佳因果消息排序算法的两种不同实现的开销。可以看到,与经典的Raynal-Schiper-Toueg算法相比,最佳算法显示的消息空间开销和日志空间开销明显更少。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号