このエントリーをはてなブックマークに追加
ID 14155
file
creator
subject
Availability
distributed systems
k-coteries
k-semicoteries
k-mutual exclusion problem
message complexity
NDC
Information science
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.
journal title
IEEE transactions on parallel and distributed systems
volume
Volume 12
issue
Issue 9
start page
865
end page
874
date of issued
2001-09
publisher
IEEE
issn
1045-9219
publisher doi
language
eng
nii type
Journal Article
HU type
Journal Articles
DCMI type
text
format
application/pdf
text version
publisher
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.
relation url
department
Graduate School of Social Sciences