The mutual exclusion problem is a problem of arbitrating access conflicts for resources. The problem has been considered as a fundamental problem in computer science and extensively studied from the first minute operating systems started providing multi-tasking or multi-programming feature. Recently, a large number of computers are connected to a computer network. Such a system is called a dist...

Operating Systems have offered Locking as a de-facto mechanism for mutual exclusion. Locks have enjoyed widespread use due to their simplicity. However the burden of protecting a critical section is left to the programmer. Programmer has to ensure that the Locks are created, acquired, released and destroyed after use. Incorrect use of Locks can lead to race conditions. In Multi-programming, par...

ÐThe performance of a mutual exclusion algorithm is measured by the number of messages exchanged per critical section execution and the delay between successive executions of the critical section. There is a message complexity and synchronization delay trade-off in mutual exclusion algorithms. The Lamport algorithm and the Ricart-Agrawal algorithm both have a synchronization delay of T (T is th...

In distributed environments, the shared resources access control by mutual exclusion paradigm is a recurrent key problem. To cope with the new constraints implied by recently developed large scale distributed systems like grids, mutual exclusion algorithms become more and more complex and thus much harder to prove and/or verify. In this article, we propose the formal modeling and the verificati...

Mutual exclusion as one of the main problems associated with distributed systems requires that at any time t, only one site can access the common copies of file f. As a result of node or link failures, distributed system may be partitioned into two or more groups of nodes which cannot communicate each other anymore; meanwhile they must be able to update their copies of file f consistently, in o...

Most of distributed mutual exclusion algorithms do not use the notion of priority. To solve the distributed prioritized mutual exclusion problem, F. Mueller[9] has already prioritized a token and tree based algorithm. The goal of this paper is to show the introduction of priority in an other token-based algorithm. This work can be considered an improvement of F.