ANALYSIS OF ROUCAIROL AND CARVALHO APPROACH IN DISTRIBUTED MUTUAL EXCLUSION (original) (raw)

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.

Empirical Evaluation of Mutual Exclusion Algorithms for Distributed Systems

Journal of Parallel and Distributed Computing, 2000

Mutual exclusion in distributed memory systems is realized by passing messages among sites to establish a sequence for the waiting sites to enter the critical section. We have evaluated various distributed mutual exclusion algorithms on the IBM SP2 machine and the Intel iPSCÂ860 system, with their empirical results compared in terms of such criteria as the number of message exchanges and response time. The results take into account the effects of critical section request rate, critical section duration, and system size. Our results indicate that the Star algorithm (1991, M. L. Neilsen and M. Mizuno, in``Proc. 11th Int. Conf. Distributed Computing Systems,'' pp. 354 360) achieves the shortest response time in most cases among all the algorithms on a small to medium-sized system, when sites request the critical section many times before involving any barrier synchronization. This is because (1) it requires the exchange of no more than three messages per critical section entry, and (2) contention can quickly be alleviated after several entries into

A new voting-based mutual exclusion algorithm for distributed systems

2013 Nirma University International Conference on Engineering (NUiCONE), 2013

Concurrency control for a distributed system had been always challenging and is getting even more critical with the increasing sophistication of such systems. There are efficient approaches reported in the existing literature that selects one candidate process from many for allowing it to enter its critical section (CS) on the basis of the number of votes received by the processes. A simple principle that a process that gets majority of the total number of votes is only to be allowed for CS ensures safety for such an algorithm as no two processes can earn majority of the total number of polls. However, this may lead to a live-lock situation where no single process reaches the magic number of majority votes. In this paper, a new voting-based algorithm has been proposed to select a process from all the candidates for CS. The proposed algorithm helps increasing the availability of the distributed system.

Two algorithms for mutual exclusion in real-time distributed computer systems

Journal of Parallel and Distributed Computing, 1990

Two algorithms developed utilizing a priority-based event-ordering which manage mutual exclusion in distributed systemscomputer networks-are proposed. in these systems, processes communicate only by messages and do not share memory. The computer network functions either (a) in an environment requiring priorities or (b) in a real-time environment. The algorithms are based on broadcast requests and token passing service approach, but the token need not be passed if no process wishes to enter the critical section. These algorithms are fully distrihuted and are insensitive to the relative speeds of node computers and communication links. They use only N messages per critical section, where N is the number of nodes (processes). The algorithms are optimal in the sense that a symmetrical, distributed algorithm cannot use fewer messages if requests are processed by each node computer concurrently. Both algorithms ensure freedom from starvation. There are mechanisms to handle node insertion and removal, node failure, the loss of the token, the existence of more than one token, and delivery of messages out of order.

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.

A Distributed Deadlock-Free Quorum-Based Algorithm for Mutual Exclusion

Quorum-based mutual exclusion algorithms enjoy many advantages such as low message complexity and high failure resiliency. The use of quorums is a well-known approach to achieving mutual exclusion in distributed environments. Several distributed based quorum mutual exclusion was presented. The number of messages required by these algorithms require between 3(sqrt of n) and 5(sqrt of n) , where n is the size of under- lying distributed system, and the deadlock can occur between requesting processes. In this paper, we present a quorum-based distributed mutual exclusion algorithm, free deadlock. Every group is organized as a logical ring of (sqrt of n) processes. A requesting process sends its request to its successor on the logical ring. When a process receives its own request after one round, it enters in the critical section. The algorithm requires 2 (sqrt of n -1) messages.

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.

Efficient Mutual Exclusion Algorithm Aasim khurshid

2012

This paper presents an algorithm that can solve the problem in single processing, multiprocessing and distributed systems efficiently with minimal changes. For distributed systems we introduce message passing service while keeping rest of the mechanism same works faster than many other algorithms for distributed systems. Due to this multiple processes can execute in different critical sections concurrently. Performance of the algorithm is analyzed in terms of memory and time.

Concurrency Control in Distributed System Using Mutual Exclusion

Studies in Systems, Decision and Control

The series "Studies in Systems, Decision and Control" (SSDC) covers both new developments and advances, as well as the state of the art, in the various areas of broadly perceived systems, decision making and control-quickly, up to date and with a high quality. The intent is to cover the theory, applications, and perspectives on the state of the art and future developments relevant to systems, decision making, control, complex processes and related areas, as embedded in the fields of engineering, computer science, physics, economics, social and life sciences, as well as the paradigms and methodologies behind them. The series contains monographs, textbooks, lecture notes and edited volumes in systems, decision making and control spanning the areas of Cyber