首页> 外文期刊>Journal of Network and Computer Applications >A performance comparison of token-and tree-based mutual exclusion algorithms on Chordal Rings
【24h】

A performance comparison of token-and tree-based mutual exclusion algorithms on Chordal Rings

机译:弦环上基于令牌和基于树的互斥算法的性能比较

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

摘要

In this paper we present a performance comparison of token-and tree-based mutual exclusion algorithms. The effect of increasing the connectivity of the network topology on the performance of Raymond's algorithm, Chang et al.'s algorithm, Helay et al.'s algorithm, and Naimi et al.'s algorithm is studied. We find that Raymond's algorithm, which uses a static logical structure-based approach, has better performance than the rest of the above-mentioned algorithms, which are dynamic logical structure-based. When the network topology is near complete, the dynamic logical structure-based Algorithms have a better response time than Raymond's algorithm. At higher loads, Raymond's algorithm has very low message traffic.
机译:在本文中,我们提出了基于令牌和基于树的互斥算法的性能比较。研究了增加网络拓扑的连通性对Raymond算法,Chang等人的算法,Helay等人的算法和Naimi等人的算法的性能的影响。我们发现,使用基于静态逻辑结构的方法的雷蒙德算法具有比上述其余基于动态逻辑结构的算法更好的性能。当网络拓扑接近完成时,基于动态逻辑结构的算法比Raymond算法具有更好的响应时间。在较高的负载下,Raymond的算法的消息流量非常低。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号