Improving the availability of mutual exclusion Systems on Incomplete Networks
IEEE transactions on computers Volume 48 Issue 7
Page 744-747
published_at 1999-07
アクセス数 : 1005 件
ダウンロード数 : 222 件
今月のアクセス数 : 0 件
今月のダウンロード数 : 0 件
この文献の参照には次のURLをご利用ください : https://ir.lib.hiroshima-u.ac.jp/00014160
File |
IEEE_1999_48_7_t0744.pdf
123 KB
種類 :
fulltext
|
Title ( eng ) |
Improving the availability of mutual exclusion Systems on Incomplete Networks
|
Creator | |
Source Title |
IEEE transactions on computers
|
Volume | 48 |
Issue | 7 |
Start Page | 744 |
End Page | 747 |
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.
|
Keywords |
Availability
coteries
distributed systems
G-nondominatedness
graph theory
mutual exclusion problems
quorums
|
NDC |
Information science [ 007 ]
|
Language |
eng
|
Resource Type | journal article |
Publisher |
IEEE
|
Date of Issued | 1999-07 |
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.
|
Publish Type | Version of Record |
Access Rights | open access |
Source Identifier |
[ISSN] 0018-9340
[DOI] 10.1109/12.780882
[DOI] http://dx.doi.org/10.1109/12.780882
isVersionOf
|