Notice of Violation of IEEE Publication PrinciplesThe Research on Mutual Exclusion Algorithm in Distributed System

Systems involving multiple processes are often most easily programmed using critical regions. When a process has to read or update certain shared data structures, it first enters a critical region to achieve mutual exclusion and ensure that no other process will use the shared data structures at the same time. In single-processor systems, critical regions are protected using semaphores, monitors, and similar constructs. In this paper, we will research how critical regions and mutual exclusion can be implemented in distributed systems.