Skip to Main Content
Notice of Violation of IEEE Publication Principles
"Research on Mutual Exclusion Algorithm in Distributed System"
by Wang Chengjun
in the Proceedings of the 2009 International Conference on Wireless Networks and Information Systems, December 2009
After careful and considered review of the content and authorship of this paper by a duly constituted expert committee, this paper has been found to be in violation of IEEE's Publication Principles.
This paper contains significant portions of original text from the paper cited below. The original text was copied without attribution (including appropriate references to the original author(s) and/or paper title) and without permission.
Due to the nature of this violation, reasonable effort should be made to remove all past references to this paper, and future references should be made to the following book:
by A. Tanenbaum and M. Van Steen,
Prentice Hall, pp. 253-260, 2007
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.