Abstract
The group mutual exclusion (GME) problem is a generalization of the mutual exclusion problem. In group mutual exclusion, a process requests a session before entering its critical section (CS). Processes requesting the same session are allowed to be in their CS simultaneously, however, processes requesting different sessions must execute their CS in mutually exclusive way. The paper presents a token-based distributed algorithm for the GME problem in asynchronous message passing systems. The algorithm uses the concept of dynamic request sets. The algorithm does not use any message to be exchanged in the best case and uses n+1 messages in the worst case, where n is the number of processes in the system. The maximum concurrency of the algorithm is n and synchronization delay under heavy load (worst case) is 2T, where T is the maximum message propagation delay. The algorithm uses first come first serve approach in selecting the next session type and satisfies the concurrent occupancy property. The static performance analysis and correctness proof is also included in the present exposition.
Highlights
A distributed system is a collection of independent computers, which are capable of collaborating on a task
Mutual exclusion is a classical problem of distributed systems, group mutual exclusion (GME) is a comparatively new problem
Concurrent occupancy: In the proposed algorithm, when a process starts execution in critical section (CS) as a captain, it allows CS entry to all the processes, requesting for the same session, whose requests are stored in the token.queue
Summary
A distributed system is a collection of independent computers, which are capable of collaborating on a task. If there are pending requests in the initialization is given in Fig. 2 and the rest of the token.queue, the captain process changes its state to N If token.queue is not empty, the captain process changes its state to N and starts new session.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have