WEKO3
アイテム
Transversal Merge Operation : A Nondominated Coterie Construction method for distributed mutual exclusion
https://hiroshima.repo.nii.ac.jp/records/2007013
https://hiroshima.repo.nii.ac.jp/records/20070139e8a3f92-5335-4c4b-ac6d-9cfbd5d3a817
| 名前 / ファイル | ライセンス | アクション |
|---|---|---|
IEEE_2005_16_2_l0183.pdf (651.4 KB)
|
| Item type | デフォルトアイテムタイプ_（フル）(1) | |||||||||
|---|---|---|---|---|---|---|---|---|---|---|
| 公開日 | 2023-03-18 | |||||||||
| タイトル | ||||||||||
| タイトル | Transversal Merge Operation : A Nondominated Coterie Construction method for distributed mutual exclusion | |||||||||
| 言語 | en | |||||||||
| 作成者 |
Harada, Takashi
× Harada, Takashi
× Yamashita, Masafumi
|
|||||||||
| アクセス権 | ||||||||||
| アクセス権 | open access | |||||||||
| アクセス権URI | http://purl.org/coar/access_right/c_abf2 | |||||||||
| 権利情報 | ||||||||||
| 権利情報 | (c) 2005 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. | |||||||||
| 主題 | ||||||||||
| 主題Scheme | Other | |||||||||
| 主題 | Coteries | |||||||||
| 主題 | ||||||||||
| 主題Scheme | Other | |||||||||
| 主題 | distributed systems | |||||||||
| 主題 | ||||||||||
| 主題Scheme | Other | |||||||||
| 主題 | grid structures | |||||||||
| 主題 | ||||||||||
| 主題Scheme | Other | |||||||||
| 主題 | mutual exclusion algorithms | |||||||||
| 主題 | ||||||||||
| 主題Scheme | Other | |||||||||
| 主題 | nondominatedness | |||||||||
| 主題 | ||||||||||
| 主題Scheme | Other | |||||||||
| 主題 | quorum consensus | |||||||||
| 主題 | ||||||||||
| 主題Scheme | Other | |||||||||
| 主題 | transversals | |||||||||
| 主題 | ||||||||||
| 主題Scheme | NDC | |||||||||
| 主題 | 540 | |||||||||
| 内容記述 | ||||||||||
| 内容記述 | A coterie is a set of subsets (called quorums) of the processes in a distributed system such that any two quorums intersect with each other and is mainly used to solve the mutual exclusion problem in a quorum-based algorithm. The choice of a coterie sensitively affects the performance of the algorithm and it is known that nondominated (ND) coteries achieve good performance in terms of criteria such as availability and load. On the other hand, grid coteries have some other attractive features : 1) A quorum size is small, which implies a low message complexity, and 2) a quorum is constructible on the fly, which benefits a low space complexity. However, they are not ND coteries unfortunately. To construct ND coteries having the favorite features of grid coteries, we introduce the transversal merge operation that transforms a dominated coterie into an ND coterie and apply it to grid coteries. We call the constructed ND coteries ND grid coteries. These ND grid coteries have availability higher than the original ones, inheriting the above desirable features from them. To demonstrate this fact, we then investigate their quorum size, load, and availability, and propose a dynamic quorum construction algorithm for an ND grid coterie. | |||||||||
| 言語 | en | |||||||||
| 出版者 | ||||||||||
| 出版者 | IEEE | |||||||||
| 言語 | ||||||||||
| 言語 | eng | |||||||||
| 資源タイプ | ||||||||||
| 資源タイプ識別子 | http://purl.org/coar/resource_type/c_6501 | |||||||||
| 資源タイプ | journal article | |||||||||
| 出版タイプ | ||||||||||
| 出版タイプ | VoR | |||||||||
| 出版タイプResource | http://purl.org/coar/version/c_970fb48d4fbd8a85 | |||||||||
| 関連情報 | ||||||||||
| 識別子タイプ | DOI | |||||||||
| 関連識別子 | 10.1109/TPDS.2005.25 | |||||||||
| 関連情報 | ||||||||||
| 関連タイプ | isVersionOf | |||||||||
| 識別子タイプ | DOI | |||||||||
| 関連識別子 | http://dx.doi.org/10.1109/TPDS.2005.25 | |||||||||
| 収録物識別子 | ||||||||||
| 収録物識別子タイプ | ISSN | |||||||||
| 収録物識別子 | 1045-9219 | |||||||||
| 開始ページ | ||||||||||
| 開始ページ | 183 | |||||||||
| 書誌情報 |
IEEE Transactions on Parallel and Distributed Systems IEEE Transactions on Parallel and Distributed Systems 巻 16, 号 2, p. 183-192, 発行日 2005-02 |
|||||||||
| 旧ID | 14149 | |||||||||
