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(⊆2<sup>V</sup>), 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
Beschreibung
IEEE Xplore Abstract - Improving the availability of mutual exclusion systems on incomplete networks
%0 Journal Article
%1 harada1999improving
%A Harada, T.
%A Yamashita, M.
%D 1999
%J Computers, IEEE Transactions on
%K availability dependability
%N 7
%P 744-747
%R 10.1109/12.780882
%T Improving the availability of mutual exclusion systems on incomplete networks
%U http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=780882
%V 48
%X 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(⊆2<sup>V</sup>), 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
@article{harada1999improving,
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(⊆2<sup>V</sup>), 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},
added-at = {2014-09-01T20:53:06.000+0200},
author = {Harada, T. and Yamashita, M.},
biburl = {https://www.bibsonomy.org/bibtex/22af75d1646b1c5a7c67f97ca0741814e/avail_map_stud},
description = {IEEE Xplore Abstract - Improving the availability of mutual exclusion systems on incomplete networks},
doi = {10.1109/12.780882},
interhash = {1aaca8e83eb2f058fa252770dbc97894},
intrahash = {2af75d1646b1c5a7c67f97ca0741814e},
issn = {0018-9340},
journal = {Computers, IEEE Transactions on},
keywords = {availability dependability},
month = jul,
number = 7,
pages = {744-747},
timestamp = {2014-09-01T20:53:06.000+0200},
title = {Improving the availability of mutual exclusion systems on incomplete networks},
url = {http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=780882},
volume = 48,
year = 1999
}