
Parallel and DistributedComputing ◾ 281
e mutual exclusion problem is to design a fair and ecient algo-
rithm to decide the temporal order among users wishing to use a shared
resource. e distributed system to solve the mutual exclusion problem
should satisfy the following conditions:
1. ere is no reachable system state in which more than one user is in
the critical region.
2. If at least one user is in the trying region and no user is in the critical
region, then at some later time point some user enters the critical region.
3. If a user is in the exit region, then at some later time point some user
enters the remainder region.