Distributed Groups Mutual Exclusion Based on Dynamical Data Structures (original) (raw)

A Token-Based Distributed Group Mutual Exclusion Algorithm with Quorums

IEEE Transactions on Parallel and Distributed Systems, 2008

The group mutual exclusion problem is a generalization of mutual exclusion problem such that a set of processes in the same group can enter critical section simultaneously. In this paper, we propose a distributed algorithm for the group mutual exclusion problem in asynchronous message passing distributed systems. Our algorithm is based on tokens, and a process that obtains a token can enter critical section. For reducing message complexity, it uses coterie as a communication structure when a process sends a request messages. Informally, coterie is a set of quorums, each of which is a subset of the process set, and any two quorums share at least one process. The message complexity of our algorithm is O(|Q|) in the worst case, where |Q| is a quorum size that the algorithm adopts. Performance of the proposed algorithm is presented by analysis and discrete event simulation. Especially, the proposed algorithm achieves high concurrency, which is a performance measure for the number of processes that can be in critical section simultaneously.

Group k-mutual exclusion for distributed systems

Proceedings of the IASTED International Conference on Parallel and Distributed Computing and Systems

In this paper, we propose an algorithm to solve the group k-mutual exclusion (Gk-ME) problem for distributed systems. The Gk-ME problem is concerned with controlling the concurrent accesses of some resource by at most k nodes with the constraint that no two distinct resources can be accessed simultaneously. The proposed algorithm utilizes a token circulation mechanism and does not require the nodes to have identifications. The delay and session switches of the proposed algorithm are Ω(n 2) and Ω(n), respectively.

A Fault Tolerant Token-Based Algorithm For Group Mutual Exclusion In Distributed Systems

2008

The group mutual exclusion (GME) problem is a variant of the mutual exclusion problem. In the present paper a token-based group mutual exclusion algorithm, capable of handling transient faults, is proposed. The algorithm uses the concept of dynamic request sets. A time out mechanism is used to detect the token loss; also, a distributed scheme is used to regenerate the token. The worst case message complexity of the algorithm is n+1. The maximum concurrency and forum switch complexity of the algorithm are n and min (n, m) respectively, where n is the number of processes and m is the number of groups. The algorithm also satisfies another desirable property called smooth admission. The scheme can also be adapted to handle the extended group mutual exclusion problem.

Comparative Study of Mutual Exclusion Algorithms in Distributed Systems

Mutual Exclusion is an important phenomenon in distributed systems. In this paper, we analyze and compare various mutual exclusion algorithms in distributed systems. In permission based mutual exclusion process waits for permission from other processes to enter into a critical section. In token based mutual exclusion, a special message called token is passed over the system and process holding the token can enter into the critical section. We present a comparative study of quorum based, token ring token asking and multiple token algorithms for mutual exclusion in distributed systems.

An O(n1/3) algorithm for distributed mutual exclusion

Journal of Systems Architecture, 1998

In this paper, a distributed algorithm is proposed that realizes mutual exclusion among n nodes in a computer network. No common or global memory is shared by the nodes and there is no global controller. The nodes of the network communicate among themselves by exchanging messages only. The best-known algorithms so far, for the distributed mutual exclusion problem, require O p n messages per mutual exclusion invocation. The proposed algorithm is the ®rst to cross this O p n barrier and the message complexity achieved by our algorithm is On 1a3 per mutual exclusion.

Group Mutual Exclusion by Fetch-and-increment

ACM Transactions on Parallel Computing, 2019

The group mutual exclusion (GME) problem (also called the room synchronization problem) arises in various practical applications that require concurrent data sharing. Group mutual exclusion aims to achieve exclusive access to a shared resource (a shared room) while facilitating concurrency among non-conflicting requests. The problem is that threads with distinct interests are not allowed to access the shared resource concurrently, but multiple threads with same interest can. In Blelloch et al. (2003), the authors presented a simple solution to the room synchronization problem using fetch8add ( F 8 A ) and test-and-set ( T 8 S ) atomic operations. This algorithm has O ( m ) remote memory references (RMRs) in the cache coherent (CC) model, where m is the number of forums. In Bhatt and Huang (2010), an open problem was posed: “ Is it possible to design a GME algorithm with constant RMR for the CC model using fetch8add instructions? ” This question is partially answered in this article ...

A hybrid distributed mutual exclusion algorithm

Journal of Systems Architecture, 1996

The problem of mutual exclusion has to be solved to prevent race condition and, as a result, prevent the possibility of a program producing an incorrect result. Providing deadlock-free distributed mutual exclusion algorithms is often difficult and it involves passing many messages. The two major types of these algorithms are token-based and permission-based algorithms. In this research, we propose a hybrid distributed mutual exclusion algorithm. By Hybrid, we mean that the algorithm uses both token-based and permission-based techniques. The best case and worst case number of messages passed for every critical region entry and exit is calculated, which are better than many other algorithms.

A quorum-based extended group mutual exclusion algorithm without unnecessary blocking

2004

This paper presents a quorum-based distributed algorithm for the extended group mutual exclusion problem. In the group mutual exclusion problem, multiple processes can enter a critical section simultaneously if they belong to the same group. Processes in different groups cannot enter a critical section at the same time. In the extended group mutual exclusion, each process is a member of multiple groups at the same time. Each process can select which group it belongs at making a request. The algorithm for the group mutual exclusion cannot be applied for this extended problem, since there can be a case that two processes are prevented from entering a critical section simultaneously even when they are capable of doing so. We call the above situation unnecessary blocking. We present a quorum-based algorithm that prevents unnecessary blocking and show its correctness proof. 1 This definition allows that when a process makes a new request after using CD , the new request might be for CD .

An Improved Token-Based and Starvation Free Distributed Mutual Exclusion Algorithm

Journal of Computer & Robotics, 2018

Distributed mutual exclusion is a fundamental problem of distributed systems that coordinates the access to critical shared resources. It concerns with how the various distributed processes access to the shared resources in a mutually exclusive manner. This paper presents fully distributed improved token based mutual exclusion algorithm for distributed system. In this algorithm, a process which has owing token, could enter to its critical section. The processes communicate to each other in an asynchronous message passing manner. We assume the distributed processes are organized in a wraparound two dimensional array. Also, the communication graph of the network is supposed to be a complete graph. The proposed algorithm uses three types of messages, namely ReqMsg, InfoMsg and RelMsg. Beside token-holding node, there are some nodes, we call them informed-nodes, which can know token-holding node and transmit request message to it directly. The number of messages, which are exchanged per each critical section entrance, is a key parameter to avoid posing additional overhead to the distributed system. In this paper, we obtain to 3√ − 1 messages per critical section access where N is the number of nodes in the system. The proposed algorithm outperforms other token based algorithms whilst fairness is kept and the proposed algorithm is starvation free.

A Review of various Mutual Exclusion Algorithms in Distributed Environment

In computer science, mutual exclusion (MUTEX) refers to a way of making sure that if one process is using shared modifiable data or resources then the other processes will be excluded from doing the same thing at the same time. A number of mutual exclusion algorithms are available in the literature, with different performance metrics and with different techniques. The Selection for a " good " mutual exclusion algorithm is a key point. These mutual exclusion algorithms can be broadly classified into token and non-token based algorithm. This paper surveys the algorithms which have been reported in the literature for Mutual exclusion in distributed systems and their comparison.