Issue No. 08 - August (1998 vol. 9)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/71.706045
<p><b>Abstract</b>—<it>Coterie</it> is a widely accepted concept for solving the mutual exclusion problem. <it>Nondominated coteries</it> are an important class of coteries which have better performance than dominated coteries. The performance of a coterie is usually measured by <it>availability</it>. Higher availability of a coterie exhibits greater ability to tolerate node or communication link failures. In this paper, we demonstrate a way to recognize nondominated coteries using availability. By evaluating the availability of a coterie instead of using a formal proof, the coterie can be recognized as a nondominated coterie or not. Moreover, with regard to <it>wr-coterie</it>, a concept for solving the replica control problem, we also present a similar result for recognizing nondominated <it>wr</it>-coteries. Finally, we apply our results to some well-known coteries and <it>wr</it>-coteries.</p>
Availability, coteries, distributed algorithms, fault tolerance, mutual exclusion, replica control, wr-coteries.
Y. Kuo and S. Huang, "Recognizing Nondominated Coteries and wr-Coteries by Availability," in IEEE Transactions on Parallel & Distributed Systems, vol. 9, no. , pp. 721-728, 1998.