A Distributed Mutual Exclusion Algorithm Based on Weak Copy Consistency

Seoung Sup LEE  Ha Ryoung OH  June Hyoung KIM  Won Ho CHUNG  Myunghwan KIM  

Publication
IEICE TRANSACTIONS on Information and Systems   Vol.E75-D   No.3   pp.298-306
Publication Date: 1992/05/25
Online ISSN: 
DOI: 
Print ISSN: 0916-8532
Type of Manuscript: PAPER
Category: Computer Networks
Keyword: 
distributed algorithm,  mutual exclusion,  critical section,  weak copy consistency,  

Full Text: PDF(816.7KB)>>
Buy this Article




Summary: 
This paper presents a destributed algorithm that uses weak copy consistency to create mutual exclusion in a distributed computer system. The weak copy consistency is deduced from the uncertainty of state which occurs due to the finite and unpredictable communication delays in a distributed environment. Also the method correlates outdated state information to current state. The average number of messages to enter critical section in the algorithm is n/2 to n messages where n is the number of sites. We show that the algorithm achieves mutual exclusion and the fairness and liveness of the algorithm is proven. We study the performance of the algorithm by simulation technique.