Mutual exclusion protocols are an essential building block of concurrent shared-memory systems: indeed, such a protocol is required whenever a shared resource has to be protected against concurrent non-atomic accesses. Hence, many variants of mutual exclusion protocols exist, such as Peterson’s or Dekker’s well-known protocols. Although the functional correctness of these protocols has been stu...

This paper addresses the issue of K-mutual exclusion in a distributed system. Our proposed algorithm divides a network into root nodes and regular nodes. The root nodes communicate with each other via a ring network and communicate directly with a set of regular nodes that they are assigned to. Mutual exclusion is achieved by using k tokens that are maintained by the root nodes, the collaborati...

Reader-writer synchronization relaxes the constraints of mutual exclusion to permit more than one process to inspect a shared object concurrently, as long as none of them changes its value. On uniprocessors, mutual exclusion and readerwriter locks are typically designed to de-schedule blocked processes; however, on shared-memory multiprocessors it is often advantageous to have processes busy wa...

The use of quorums is a well-known approach to achieving mutual exclusion in distributed environments. In this paper, we propose a new availability evaluation method for quorum-based mutual exclusion schemes in the presence of failures. Most of the previously proposed methods take neither the topology of systems nor link failures into consideration, and exhaustive state enumeration has been the...

Mutual exclusion protocols are an essential building block of concurrent systems: indeed, such a protocol is required whenever a shared resource has to be protected against concurrent non-atomic accesses. Hence, many variants of mutual exclusion protocols exist in the shared-memory setting, such as Peterson’s or Dekker’s well-known protocols. Although the functional correctness of these protoco...

A distributed system consists of a set of processes and a set of communication links. A distributed system is said to be self-stabilizing if it converges to a correct system state from arbitrary initial system states. A self-stabilizing system is considered to be a fault tolerant system , since it tolerates any kind and any finite number of transient failures. The leader election and mutual exc...

We provide the implementation results of the distributed mutual exclusion algorithm based on Ricart-Agrawala algorithm for mobile ad hoc networks (MANETs) using the ns2 simulator described in [2]. The MANET consists of a ring of clusters and it is partitioned into a number of clusters periodically using the MCA [11]. Each cluster is represented by a coordinator. We also show a new algorithm to ...

This paper presents a framework for fault-tolerant distributed mutual exclusion and replica control algorithms utilizing overlapping grid quorums, which are sets constructed with the aid of grid structures. There are two components of the framework: the first one concerns generic representation of grid quorums, and the second one, generic verification of the overlapping properties of grid quoru...

A distributed system consists of a set of processes and a set of communication links. A distributed system is said to be self-stabilizing if it converges to a correct system state from arbitrary initial system states. A self-stabilizing system is considered to be a fault tolerant system , since it tolerates any kind and any finite number of transient failures. The leader election and mutual exc...

Mutual Exclusion in a fully distributed computer system contains a lot of complexities related to the solution design and its implementation. A number of solutions have been proposed for solving mutual exclusion problem for fully distributed environment but most of them are related to higher message passing overheads over the network, which causes low performance and efficiency. In this paper a...