Publication 1999 Issue No. 7 - July Abstract - Improving the Availability of Mutual Exclusion Systems on Incomplete Networks
Improving the Availability of Mutual Exclusion Systems on Incomplete Networks
July 1999 (vol. 48 no. 7)
pp. 744-747
 ASCII Text x Takashi Harada, Masafumi Yamashita, "Improving the Availability of Mutual Exclusion Systems on Incomplete Networks," IEEE Transactions on Computers, vol. 48, no. 7, pp. 744-747, July, 1999.
 BibTex x @article{ 10.1109/12.780882,author = {Takashi Harada and Masafumi Yamashita},title = {Improving the Availability of Mutual Exclusion Systems on Incomplete Networks},journal ={IEEE Transactions on Computers},volume = {48},number = {7},issn = {0018-9340},year = {1999},pages = {744-747},doi = {http://doi.ieeecomputersociety.org/10.1109/12.780882},publisher = {IEEE Computer Society},address = {Los Alamitos, CA, USA},}
 RefWorks Procite/RefMan/Endnote x TY - JOURJO - IEEE Transactions on ComputersTI - Improving the Availability of Mutual Exclusion Systems on Incomplete NetworksIS - 7SN - 0018-9340SP744EP747EPD - 744-747A1 - Takashi Harada, A1 - Masafumi Yamashita, PY - 1999KW - AvailabilityKW - coteriesKW - distributed systemsKW - $G$-nondominatednessKW - graph theoryKW - mutual exclusion problemsKW - quorums.VL - 48JA - IEEE Transactions on ComputersER -

Abstract—We model a distributed system by a graph $G=(V,E)$, where $V$ represents the set of processes and $E$ the set of bidirectional communication links between two processes. $G$ may not be complete. A popular (distributed) mutual exclusion algorithm on $G$ uses a coterie ${\cal C} (\subseteq 2^V)$, which is a nonempty set of nonempty subsets of $V$ (called quorums) such that, for any two quorums $P, Q \in {\cal C}$, 1) $P \cap Q \ne \emptyset$ and 2) $P \not\subset Q$ hold. The availability is the probability that the algorithm tolerates process and/or link failures, given the probabilities that a process and a link, respectively, are operational. The availability depends on the coterie used in the algorithm. This paper proposes a method to improve the availability by transforming a given coterie.

Index Terms:
Availability, coteries, distributed systems, $G$-nondominatedness, graph theory, mutual exclusion problems, quorums.
Citation:
Takashi Harada, Masafumi Yamashita, "Improving the Availability of Mutual Exclusion Systems on Incomplete Networks," IEEE Transactions on Computers, vol. 48, no. 7, pp. 744-747, July 1999, doi:10.1109/12.780882