The Research And Improvement Of Distributed Exclusion Algorithm

In distributed system, competing for critical resource happens when critical resource is accessed by several intercurrent processes that are distributed in different computers. When modified or used incorrectly, critical resource would lose its correctness and integrity. In order to ensure critical resource to be correct and the whole system to be consistent, the distributed processes should be synchronized and the critical resources should be exclusively accessed.In the paper, the issue of distributed synchronization and exclusion is studied. After analyzing some existing distributed exclusion algorithms, one of them called Goscinski Algorithm has been improved. In order to prove that the improved algorithm is better, the performance of the improved algorithm is analyzed in detail and the comparison among improved algorithm, Goscinski Algorithm and some other algorithms is given as well.As is designed to solve synchronization and exclusion problem in distributed system, distributed exclusion algorithm should be provided with the competence of fault-tolerance. In the paper, some fault-tolerance solutions could ensure the improved algorithm to recover from several system errors.Furthermore, the experiment shows that the improved algorithm offers better performance.