Analysis of distributed mutual exclusion algorithms

Abstract

In computer technology, mutual exclusion is basically an attribute of control of concurrency, which is generally used to prevent the condition of race. There is a requirement that not more than one thread can enter a critical section at the same time. This requirement of mutual exclusion was introduced by Edsger W. Dijkstra in 1965 in his paper entitled, “Analysis of Distributed Mutual Exclusion Algorithm”. Message Complexity, Critical section, throughput, and synchronization delay are the major part of these algorithms. Here we are analyzing Lamport Algorithm and Ricart–Agrawala algorithm for the message Complexity, synchronization delay, and system throughput.