首页> 外文会议>International Symposium on Parallel and Distributed Processing and Applications(ISPA 2005); 20051102-05; Nanjing(CN) >A Quorum Based Group k-Mutual Exclusion Algorithm for Open Distributed Environments
【24h】

A Quorum Based Group k-Mutual Exclusion Algorithm for Open Distributed Environments

机译:开放分布式环境中基于仲裁的群k互斥算法

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

摘要

This paper presents a quorum-based group k-mutual exclusion algorithm for open distributed computing systems that can evolve their behavior based on membership changes in the environment. The algorithm consists of two main layers; the quorum-consensus and quorum-reconfiguration. The quorum consensus layer is used to handle requests from and to the application layer, and it directly adopts a proposed k-coterie based algorithm of the group k-mutual exclusion in the static environments without any change to its protocol. Thus, the message complexity and quorum availability are the same as in the static environments. The quorum reconfiguration reconstructs information structure of the k-coterie by simply implementing the properties of two quorum input operations called coterie-join and coterie-cross. The reconfiguration layer is simple to use and has a great ability to complete any operation during reconfiguration powerfully thus system does not enter the halt state.
机译:本文针对开放式分布式计算系统提出了一种基于仲裁的组k互斥算法,该算法可以根据环境中的成员资格变化来演化其行为。该算法包括两个主要层;仲裁共识和仲裁重新配置。仲裁共识层用于处理来自应用程序层的请求,并直接在静态环境中直接采用提出的基于k层的k组互斥算法,而无需更改其协议。因此,消息的复杂性和仲裁可用性与静态环境中的相同。仲裁重新配置通过简单地实现两个称为coterie-join和coterie-cross的仲裁输入操作的属性来重建k-coterie的信息结构。重新配置层易于使用,并且具有强大的能力,可以强大地完成重新配置期间的所有操作,因此系统不会进入暂停状态。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号