このエントリーをはてなブックマークに追加
ID 14160
file
creator
subject
Availability
coteries
distributed systems
G-nondominatedness
graph theory
mutual exclusion problems
quorums
NDC
Information science
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 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 ≠φ 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.
journal title
IEEE transactions on computers
volume
Volume 48
issue
Issue 7
start page
744
end page
747
date of issued
1999-07
publisher
IEEE
issn
0018-9340
publisher doi
language
eng
nii type
Journal Article
HU type
Journal Articles
DCMI type
text
format
application/pdf
text version
publisher
rights
(c) 2004 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.
relation is version of URL
http://dx.doi.org/10.1109/12.780882
department
Graduate School of Social Sciences