Distributed Mutual Exclusion Token-Permission Based by Prioritized Groups
نویسندگان
چکیده
Sites with the same priority are gathered in the same group. Communication inside a group is organized in a logical rooted tree structure. The tree’s root is the site that last held the token. This organization is similar to that of Raymond's algorithm. For its external communications, a group resorts to an external supplementary element: a router. This router manages external communications. The communication protocol between routers is similar to that of Ricart_Agrawala. Priority between routers is carried out by a comparison mechanism. When it receives a permission request from a router having priority, a router temporarily suspends the request execution of its global waiting queue.
منابع مشابه
An Improved Token-Based and Starvation Free Distributed Mutual Exclusion Algorithm
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...
متن کاملImprovement of the distributed algorithms of mutual exclusion by introducing the priority
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.
متن کامل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 ...
متن کاملPrioritized Token-Based Mutual Exclusion for Distributed Systems
A number of solutions have been proposed for the problem of mutual exclusion in distributed systems. Some of these approaches have since been extended to a prioritized environment suitable for real-time applications but impose a higher message passing overhead than our approach. We present a new protocol for prioritized mutual exclusion in a distributed environment. Our approach uses a token-ba...
متن کاملThe Prioritized and Distributed Synchronization in Distributed Groups
A simple and cheap algorithm is presented to allow prioritized mutual exclusion. There are several groups. All the members of a same group have the same level priority. Our algorithm is a token-based algorithm. Each group of participants (site) is represented by a tree structure. Inside a group, the requests are recorded in a global queue which circulates simultaneously and together with the to...
متن کامل