WEKO3
アイテム
Coterie Join Operation and Tree Structured k-Coteries
https://hiroshima.repo.nii.ac.jp/records/2007038
https://hiroshima.repo.nii.ac.jp/records/20070384cb1a087-9b6f-4f4c-86fe-b35fafe360cb
| 名前 / ファイル | ライセンス | アクション |
|---|---|---|
IEEE_2001_12_9_l0865.pdf (180.4 KB)
|
| Item type | デフォルトアイテムタイプ_（フル）(1) | |||||||||
|---|---|---|---|---|---|---|---|---|---|---|
| 公開日 | 2023-03-18 | |||||||||
| タイトル | ||||||||||
| タイトル | Coterie Join Operation and Tree Structured k-Coteries | |||||||||
| 言語 | en | |||||||||
| 作成者 |
Harada, Takashi
× Harada, Takashi
× Yamashita, Masafumi
|
|||||||||
| アクセス権 | ||||||||||
| アクセス権 | open access | |||||||||
| アクセス権URI | http://purl.org/coar/access_right/c_abf2 | |||||||||
| 権利情報 | ||||||||||
| 権利情報 | (c) 2001 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 | |||||||||
| 主題 | Availability | |||||||||
| 主題 | ||||||||||
| 主題Scheme | Other | |||||||||
| 主題 | distributed systems | |||||||||
| 主題 | ||||||||||
| 主題Scheme | Other | |||||||||
| 主題 | k-coteries | |||||||||
| 主題 | ||||||||||
| 主題Scheme | Other | |||||||||
| 主題 | k-semicoteries | |||||||||
| 主題 | ||||||||||
| 主題Scheme | Other | |||||||||
| 主題 | k-mutual exclusion problem | |||||||||
| 主題 | ||||||||||
| 主題Scheme | Other | |||||||||
| 主題 | message complexity | |||||||||
| 主題 | ||||||||||
| 主題Scheme | NDC | |||||||||
| 主題 | 007 | |||||||||
| 内容記述 | ||||||||||
| 内容記述 | The coterie join operation proposed by Neilsen and Mizuno produces, from a k-coterie and a coterie, a new k-coterie. For the coterie join operation, this paper first shows 1) a necessary and sufficient condition to produce a nondominated k-coterie (more accurately, a nondominated k-semicoterie satisfying Nonintersection Property) and 2) a sufficient condition to produce a k-conterie with higher availability. By recursively applying the coterie join operation in such a way that the above conditions hold, we define nondominated k-coteries, called tree structured k-coteries, the availabilities of which are thus expected to be very high. This paper then proposes a new k-mutual exclusion algorithm that effectively uses a tree structured k-coterie, by extending Agrawal and El Abbadi's tree algoriyhm. The number of messages necessary for k processes obeying the algorithm to simultaneously enter the critical section is approximately bounded by k log (n / k) in the best case, where n is the number of processes in the system. | |||||||||
| 言語 | 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/71.954617 | |||||||||
| 関連情報 | ||||||||||
| 識別子タイプ | DOI | |||||||||
| 関連識別子 | http://dx.doi.org/10.1109/71.954617 | |||||||||
| 収録物識別子 | ||||||||||
| 収録物識別子タイプ | ISSN | |||||||||
| 収録物識別子 | 1045-9219 | |||||||||
| 開始ページ | ||||||||||
| 開始ページ | 865 | |||||||||
| 書誌情報 |
IEEE transactions on parallel and distributed systems IEEE transactions on parallel and distributed systems 巻 12, 号 9, p. 865-874, 発行日 2001-09 |
|||||||||
| 旧ID | 14155 | |||||||||
