A Distributed Mutual Exclusion Algorithm Based on Weak Copy Consistency
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.
- Publication
- IEICE TRANSACTIONS on Information Vol.E75-D No.3 pp.298-306
- Publication Date
- 1992/05/25
- Publicized
- Online ISSN
- DOI
- Type of Manuscript
- PAPER
- Category
- Computer Networks
Authors
Keyword
Latest Issue
Copyrights notice of machine-translated contents
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Cite this
Copy
Seoung Sup LEE, Ha Ryoung OH, June Hyoung KIM, Won Ho CHUNG, Myunghwan KIM, "A Distributed Mutual Exclusion Algorithm Based on Weak Copy Consistency" in IEICE TRANSACTIONS on Information,
vol. E75-D, no. 3, pp. 298-306, May 1992, doi: .
Abstract: 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.
URL: https://global.ieice.org/en_transactions/information/10.1587/e75-d_3_298/_p
Copy
@ARTICLE{e75-d_3_298,
author={Seoung Sup LEE, Ha Ryoung OH, June Hyoung KIM, Won Ho CHUNG, Myunghwan KIM, },
journal={IEICE TRANSACTIONS on Information},
title={A Distributed Mutual Exclusion Algorithm Based on Weak Copy Consistency},
year={1992},
volume={E75-D},
number={3},
pages={298-306},
abstract={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.},
keywords={},
doi={},
ISSN={},
month={May},}
Copy
TY - JOUR
TI - A Distributed Mutual Exclusion Algorithm Based on Weak Copy Consistency
T2 - IEICE TRANSACTIONS on Information
SP - 298
EP - 306
AU - Seoung Sup LEE
AU - Ha Ryoung OH
AU - June Hyoung KIM
AU - Won Ho CHUNG
AU - Myunghwan KIM
PY - 1992
DO -
JO - IEICE TRANSACTIONS on Information
SN -
VL - E75-D
IS - 3
JA - IEICE TRANSACTIONS on Information
Y1 - May 1992
AB - 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.
ER -
English
