Coterie Join Operation and Tree Structured k-Coteries
IEEE transactions on parallel and distributed systems Volume 12 Issue 9
Page 865-874
published_at 2001-09
アクセス数 : 1139 件
ダウンロード数 : 268 件
今月のアクセス数 : 4 件
今月のダウンロード数 : 0 件
この文献の参照には次のURLをご利用ください : https://ir.lib.hiroshima-u.ac.jp/00014155
File |
IEEE_2001_12_9_l0865.pdf
180 KB
種類 :
fulltext
|
Title ( eng ) |
Coterie Join Operation and Tree Structured k-Coteries
|
Creator | |
Source Title |
IEEE transactions on parallel and distributed systems
|
Volume | 12 |
Issue | 9 |
Start Page | 865 |
End Page | 874 |
Abstract |
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.
|
Keywords |
Availability
distributed systems
k-coteries
k-semicoteries
k-mutual exclusion problem
message complexity
|
NDC |
Information science [ 007 ]
|
Language |
eng
|
Resource Type | journal article |
Publisher |
IEEE
|
Date of Issued | 2001-09 |
Rights |
(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.
|
Publish Type | Version of Record |
Access Rights | open access |
Source Identifier |
[ISSN] 1045-9219
[DOI] 10.1109/71.954617
[DOI] http://dx.doi.org/10.1109/71.954617
|