• Rishikesh Rawat
• Dr. Sarvottam Dixit

The selection of a ‘good’ mutual exclusion algorithm, for the design of distributed systems, is of great importance. A number of mutual exclusion algorithms, with different techniques and varying performance characteristics, are available in the literature. These algorithms can be broadly classified into token based algorithms and non-token based algorithms. A number of survey papers for non-token based mutual exclusion algorithms exist. Although, some of them include discussion on token based mutual exclusion algorithms too, however, none of them include any discussion on the newer variants of classic mutual exclusion, like k-mutual exclusion and group mutual exclusion. we present the Permission-Based clustered Mutual Exclusion Algorithm in distributed systems. This algorithm provides better result than Reddy algorithm. The algorithm is depend on token-based technique and requires a lot number of messages to enter the critical section (CS) and to detect the system failures. We analyze the algorithm, provide performance results of the implementation, discuss the fault tolerance and the other algorithmic extensions.

Mutual Exclusion, Permission based algorithm, Fault tolerance, Distributed system.

"AN EFFICIENT METHOD OF FAULT TOLERANT PERMISSION BASED CLUSTERED MUTUAL EXCLUSION ALGORITHM IN DISTRIBUTED SYSTEM", International Journal of Emerging Technologies and Innovative Research (www.jetir.org), ISSN:2349-5162, Vol.6, Issue 3, page no.635-641, March-2019, Available :http://www.jetir.org/papers/JETIR1903B98.pdf

"AN EFFICIENT METHOD OF FAULT TOLERANT PERMISSION BASED CLUSTERED MUTUAL EXCLUSION ALGORITHM IN DISTRIBUTED SYSTEM", International Journal of Emerging Technologies and Innovative Research (www.jetir.org | UGC and issn Approved), ISSN:2349-5162, Vol.6, Issue 3, page no. pp635-641, March-2019, Available at : http://www.jetir.org/papers/JETIR1903B98.pdf