Improving the availability of mutual exclusion Systems on Incomplete Networks

IEEE transactions on computers 48 巻 7 号 744-747 頁 1999-07 発行
アクセス数 : 1006
ダウンロード数 : 222

今月のアクセス数 : 1
今月のダウンロード数 : 0
ファイル情報(添付)
IEEE_1999_48_7_t0744.pdf 123 KB 種類 : 全文
タイトル ( eng )
Improving the availability of mutual exclusion Systems on Incomplete Networks
作成者
収録物名
IEEE transactions on computers
48
7
開始ページ 744
終了ページ 747
抄録
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.
著者キーワード
Availability
coteries
distributed systems
G-nondominatedness
graph theory
mutual exclusion problems
quorums
NDC分類
情報科学 [ 007 ]
言語
英語
資源タイプ 学術雑誌論文
出版者
IEEE
発行日 1999-07
権利情報
(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.
出版タイプ Version of Record(出版社版。早期公開を含む)
アクセス権 オープンアクセス
収録物識別子
[ISSN] 0018-9340
[DOI] 10.1109/12.780882
[DOI] http://dx.doi.org/10.1109/12.780882 ~の異版である