New approach of constructing information structure for mutual exclusion in distributed systems

Hsiou Mien Lien*, Shyan-Ming Yuan

*Corresponding author for this work

Research output: Contribution to conferencePaperpeer-review

1 Scopus citations

Abstract

We present a decentralized, symmetric mutual exclusion algorithm in a computer network. The proposed algorithm has the same message complexity as that of the Maekawa's O(√N) mutual exclusion algorithm and can be applied to arbitrary sizes of distributed systems. It is more suitable than Maekawa's when the symmetry of a system is a criticism. In addition, our algorithm has smaller request set size than that of Gupta, Bruell and Ghosh's mutual exclusion algorithm on a system of size 2n for some integer n.

Original languageEnglish
Pages588-591
Number of pages4
StatePublished - 1 Dec 1994
EventProceedings of the 1994 International Conference on Parallel and Distributed Systems - Hsinchu, China
Duration: 19 Dec 199421 Dec 1994

Conference

ConferenceProceedings of the 1994 International Conference on Parallel and Distributed Systems
CityHsinchu, China
Period19/12/9421/12/94

Fingerprint Dive into the research topics of 'New approach of constructing information structure for mutual exclusion in distributed systems'. Together they form a unique fingerprint.

Cite this