Coterie Join Operation and Tree Structured k-Coteries
この文献の参照には次のURLをご利用ください : https://ir.lib.hiroshima-u.ac.jp/00014155
ID | 14155 |
本文ファイル | |
著者 | |
キーワード | Availability
distributed systems
k-coteries
k-semicoteries
k-mutual exclusion problem
message complexity
|
NDC |
情報科学
|
抄録(英) | 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.
|
掲載誌名 |
IEEE transactions on parallel and distributed systems
|
巻 | 12巻
|
号 | 9号
|
開始ページ | 865
|
終了ページ | 874
|
出版年月日 | 2001-09
|
出版者 | IEEE
|
ISSN | 1045-9219
|
出版者DOI | |
言語 |
英語
|
NII資源タイプ |
学術雑誌論文
|
広大資料タイプ |
学術雑誌論文
|
DCMIタイプ | text
|
フォーマット | application/pdf
|
著者版フラグ | publisher
|
権利情報 | (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.
|
関連情報URL | |
部局名 |
社会科学研究科
|