A quorum based group k-mutual exclusion algorithm for open distributed environments

Authors:
Armin Lawi;Kentaro Oda;Takaichi Yoshida
Affiliations:
Porgram of Creation Informatics, Kyushu Institute of Technology, Fukuoka, Japan;Porgram of Creation Informatics, Kyushu Institute of Technology, Fukuoka, Japan;Porgram of Creation Informatics, Kyushu Institute of Technology, Fukuoka, Japan
Venue:
ISPA'05 Proceedings of the Third international conference on Parallel and Distributed Processing and Applications
Year:
2005

Citing 10
Cited 1

How to assign votes in a distributed system

Journal of the ACM (JACM)
An efficient and fault-tolerant solution for distributed mutual exclusion

ACM Transactions on Computer Systems (TOCS)
A N algorithm for mutual exclusion in decentralized systems

ACM Transactions on Computer Systems (TOCS)
Fail-stop processors: an approach to designing fault-tolerant computing systems

ACM Transactions on Computer Systems (TOCS)
Coterie Join Algorithm

IEEE Transactions on Parallel and Distributed Systems
A simple group mutual l-exclusion algorithm

Information Processing Letters
Obtaining Nondominated K-Coteries for Fault-Tolerant Distributed K-Mutual Exclusion

Proceedings of the 1994 International Conference on Parallel and Distributed Systems
Distributed k-Mutual Exclusion Problem and k-Coteries

ISA '91 Proceedings of the 2nd International Symposium on Algorithms
Quorum-Based Algorithms for Group Mutual Exclusion

IEEE Transactions on Parallel and Distributed Systems
A Simple Quorum Reconfiguration for Open Distributed Environments

ICPADS '05 Proceedings of the 11th International Conference on Parallel and Distributed Systems - Workshops - Volume 02

Quorum based distributed conflict resolution algorithm for bounded capacity resources

ISPA'06 Proceedings of the 2006 international conference on Frontiers of High Performance Computing and Networking

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.