Scheduled System Maintenance:
On April 27th, single article purchases and IEEE account management will be unavailable from 2:00 PM - 4:00 PM ET (18:00 - 20:00 UTC).
We apologize for the inconvenience.
By Topic

Improving the availability of mutual exclusion systems on incomplete networks

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

The purchase and pricing options are temporarily unavailable. Please try again later.
2 Author(s)
Harada, T. ; Center of Inf. Process., Hiroshima Univ., Japan ; Yamashita, M.

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 C(⊆2V), which is a nonempty set of nonempty subsets of V (called quorums) such that, for any two quorums P, Q∈C, 1) P∪Q≠0 and 2) P⊄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

Published in:

Computers, IEEE Transactions on  (Volume:48 ,  Issue: 7 )