TY - JOUR
T1 - Coterie join operation and tree structured k-coteries
AU - Harada, Takashi
AU - Yamashita, Masafumi
PY - 2001/9
Y1 - 2001/9
N2 - 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-coterie 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 algorithm. The number of messages necessary for k processes obeying the algorithm to simultaneously enter the critical section is approximately bounded by klog(n/k) in the best case, where n is the number of processes in the system.
AB - 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-coterie 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 algorithm. The number of messages necessary for k processes obeying the algorithm to simultaneously enter the critical section is approximately bounded by klog(n/k) in the best case, where n is the number of processes in the system.
UR - http://www.scopus.com/inward/record.url?scp=0035439108&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=0035439108&partnerID=8YFLogxK
U2 - 10.1109/71.954617
DO - 10.1109/71.954617
M3 - Article
AN - SCOPUS:0035439108
VL - 12
SP - 865
EP - 874
JO - IEEE Transactions on Parallel and Distributed Systems
JF - IEEE Transactions on Parallel and Distributed Systems
SN - 1045-9219
IS - 9
ER -