This Article 
 Bibliographic References 
 Add to: 
Recognizing Nondominated Coteries and wr-Coteries by Availability
August 1998 (vol. 9 no. 8)
pp. 721-728

AbstractCoterie is a widely accepted concept for solving the mutual exclusion problem. Nondominated coteries are an important class of coteries which have better performance than dominated coteries. The performance of a coterie is usually measured by availability. 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 wr-coterie, a concept for solving the replica control problem, we also present a similar result for recognizing nondominated wr-coteries. Finally, we apply our results to some well-known coteries and wr-coteries.

[1] D. Agrawal and A.E. Abbadi, An Efficient and Fault-Tolerant Solution for Distributed Mutual Exclusion ACM Trans. Computing Systems, vol. 9, no. 1, pp. 1-20, 1991.
[2] D. Barbara and H. Garcia-Molina, "The Reliability of Voting Mechanisms," IEEE Trans. Computers, vol. 36, pp. 1,197-1,208, Oct. 1987.
[3] P. Bernstein, V. Hadzilacos, and N. Goodman, Concurrency Control and Recovery in Database Systems. Addison-Wesley, 1987.
[4] S.Y. Cheung, M.H. Ammar, and M. Ahamad, "The Grid Protocol: A High Performance Scheme for Maintaining Replicated Data," IEEE Trans. Knowledge and Data Eng., vol. 4, no. 6, pp. 582-592, 1992.
[5] H. Garcia-Molina and D. Barbara, “How to Assign Votes in a Distributed System,” J. ACM, vol. 32, no. 4, pp. 841-860, Oct. 1985.
[6] T. Ibaraki and T. Kameda, "A Theory of Coteries: Mutual Exclusion in Distributed Systems," IEEE Trans. Parallel and Distributed Systems, vol. 4, pp. 779-794, July 1993.
[7] J.R. Jiang, S.T. Huang, and Y.C. Kuo, "Cohorts Structures for Fault-Tolerant k Entries to a Critical Section," IEEE Trans. Computers, vol. 46, no. 2, pp. 222-228, Feb. 1997.
[8] A. Kumar, “Hierarchical Quorum Consensus: A New Algorithm for Managing Replicated Data,” IEEE Trans. Computers, vol. 40, no. 9, pp. 996-1,004, Sept. 1991.
[9] A. Kumar, M. Rabinovich, and R.K. Sinha, "A Performance Study of General Grid Structures for Replicated Data," Proc. IEEE Int'l Conf. Distributed Computing. Systems, pp. 178-185, 1993.
[10] Y.C. Kuo and S.T. Huang, A Geometric Approach for Constructing Coteries andk-Coteries IEEE Trans. Parallel and Distributed Systems, vol. 8, no. 4, pp. 402-411, Apr. 1997.
[11] C.L. Liu, Introduction to Combinational Mathematics.New York: McGraw-Hill, 1968.
[12] M. Maekawa, “A$\sqrt N $Algorithm for Mutual Exclusion in Decentralized Systems,” ACM Trans. Computer Systems, vol. 3, no. 2, pp. 145-159, May 1985.
[13] M.L. Neilsen, "Quorum Structures in Distributed Systems," PhD thesis, Kansas State Univ., May 1992.
[14] M.L. Nielsen and M. Mizuno,“Coterie join algorithm,” IEEE Trans. Parallel and Distributed Systems, vol. 3, no. 5, pp. 582-590, Sept. 1992.
[15] R.H. Thomas, “A Majority Consensus Approach to Concurrency Control,” ACM Trans. Database Systems, vol. 4, no. 2, pp. 180-209, June 1979.

Index Terms:
Availability, coteries, distributed algorithms, fault tolerance, mutual exclusion, replica control, wr-coteries.
Yu-Chen Kuo, Shing-Tsaan Huang, "Recognizing Nondominated Coteries and wr-Coteries by Availability," IEEE Transactions on Parallel and Distributed Systems, vol. 9, no. 8, pp. 721-728, Aug. 1998, doi:10.1109/71.706045
Usage of this product signifies your acceptance of the Terms of Use.