The Community for Technology Leaders
Green Image
Issue No. 02 - February (2005 vol. 16)
ISSN: 1045-9219
pp: 183-192
Takashi Harada , IEEE Computer Society
Masafumi Yamashita , IEEE Computer Society
<p><b>Abstract</b>—A coterie is a set of subsets (called quorums) of the processes in a distributed system such that any two quorums intersect with each other and is mainly used to solve the mutual exclusion problem in a quorum-based algorithm. The choice of a coterie sensitively affects the performance of the algorithm and it is known that nondominated (ND) coteries achieve good performance in terms of criteria such as availability and load. On the other hand, grid coteries have some other attractive features: 1) A quorum size is small, which implies a low message complexity, and 2) a quorum is constructible on the fly, which benefits a low space complexity. However, they are not ND coteries unfortunately. To construct ND coteries having the favorite features of grid coteries, we introduce the transversal merge operation that transforms a dominated coterie into an ND coterie and apply it to grid coteries. We call the constructed ND coteries ND grid coteries. These ND grid coteries have availability higher than the original ones, inheriting the above desirable features from them. To demonstrate this fact, we then investigate their quorum size, load, and availability, and propose a dynamic quorum construction algorithm for an ND grid coterie.</p>
Coteries, distributed systems, grid structures, mutual exclusion algorithms, nondominatedness, quorum consensus, transversals.

M. Yamashita and T. Harada, "Transversal Merge Operation: A Nondominated Coterie Construction Method for Distributed Mutual Exclusion," in IEEE Transactions on Parallel & Distributed Systems, vol. 16, no. , pp. 183-192, 2005.
88 ms
(Ver 3.3 (11022016))