Critical Section and Mutual Exclusion Problem in Distributed System

Abstract

Distributed system is one which has a number of systems connected to it. Each of them does not share a
common memory and they do not have a global clock. And these systems communicate with each other by passing
messages. One of the major design consideration is resource sharing. And the problem arises while dealing with the
critical section. CS is a part of the program or code which can be accessed by only one process at a time. If two or more
processes try to gain access to that critical region then the problems may arise in the system. The major problem due to
this is known as deadlock. So to avoid this condition some algorithms are designed. Out of these proposed algorithms
this paper analyze two of the algorithms compare the result of the same. Two algorithms taken in this paper are "baker's
algorithm" and other one is the "Dekker's algorithm".