This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Coterie Join Operation and Tree Structured k-Coteries
September 2001 (vol. 12 no. 9)
pp. 865-874

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-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 k\log(n/k) in the best case, where n is the number of processes in the system.

[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. Agrawal, O. Egecioglu, and A. El Abbadi, Analysis of Quorum-Based Protocols for Distributed (k+1)- Exclusion IEEE Trans. Parallel and Distributed Systems, vol. 8, no. 5, pp. 533-537, May 1997.
[3] D. Barbara and H. Garcia-Molina, "The Reliability of Voting Mechanisms," IEEE Trans. Computers, vol. 36, pp. 1,197-1,208, Oct. 1987.
[4] J.C. Bioch and T. Ibaraki, “Generating and Approximating Nondominated Coteries,” IEEE Trans. Parallel and Distributed Systems, vol. 6, no. 9, pp. 905-914, Sept. 1995.
[5] 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.
[6] H.K. Chang, S.M. Yuan, “Performance Characterization of the Tree Quorum Algorithm,” IEEE Trans. Parallel and Distributed Systems, vol. 6, no. 6, pp. 658-662, June 1995.
[7] K. Diks, E. Kranakis, D. Krizanc, B. Mans, and A. Pelc, "Optimal Coteries and Voting Schemes," Information Processing Letters, vol. 51, pp. 1-6, 1994.
[8] S. Fujita, M. Yamashita, and T. Ae, "Distributed k-Mutual Exclusion Problem and k-Coteries," Proc. Symp. Algorithms, pp. 22-31, 1991.
[9] D.K. Gifford, “Weighted Voting for Replicated Data,” Proc. Seventh ACM SIGOPS Symp. Operating Systems Principles, pp. 150-159, Dec. 1979.
[10] 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.
[11] S.T. Huang, J.R. Jiang, and Y.C. Kuo, K-Coteries for Fault-Tolerant k Entries to a Critical Section Proc. 13th Int'l Conf. Distributed Computing Systems, pp. 74-81, May 1993.
[12] 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.
[13] J.R. Jiang and S.T. Huang, Obtaining Nondominated K-Coteries for Fault-Tolerant Distributed K-Mutual Exclusion Proc. Int'l Conf. Parallel and Distributed Systems, 1994.
[14] H. Kakugawa, S. Fujita, M. Yamashita, and T. Ae, “A Distributedk-Mutual Exclusion Algorithm Usingk-Coterie,” Information Processing Letters, vol. 49, no. 4, pp. 213-218, Feb. 1994.
[15] 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.
[16] 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.
[17] 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.
[18] M.L. Nielsen and M. Mizuno,“Coterie join algorithm,” IEEE Trans. Parallel and Distributed Systems, vol. 3, no. 5, pp. 582-590, Sept. 1992.
[19] M.L. Neilsen and M. Mizuno, “Nondominatedk-Coteries for Multiple Mutual Exclusion,” Information Processing Letters, vol. 50, no. 5, pp. 247-252, June 1994.
[20] M.L. Neilsen and M. Mizuno, “Erratum to Nondominatedk-Coteries for Multiple Mutual Exclusion,” Information Processing Letters, vol. 60, no. 6, pp. 319-23, Dec. 1996.
[21] K. Raymond, "A Distributed Algorithm for Multiple Entries to a Critical Section," Information Processing Letters, vol. 30, no. 4, pp. 189-193, Feb. 1989.
[22] P.K. Srimani and R.L.N. Reddy, "Another Distributed Algorithm for Multiple Entries to a Critical Section," Information Processing Letters, vol. 41, no. 1, pp. 51-57, Jan. 1992.
[23] S.M. Yuan and H.K. Chang, “Message Complexity of the Tree Quorum Algorithm,” IEEE Trans. Parallel and Distributed Systems, vol. 6, no. 8, pp. 887-890, Aug. 1995.

Index Terms:
Availability, distributed systems, k-coteries, k-semicoteries, k-mutual exclusion problem, message complexity, nondominatedness, quorums.
Citation:
Takashi Harada, Masafumi Yamashita, "Coterie Join Operation and Tree Structured k-Coteries," IEEE Transactions on Parallel and Distributed Systems, vol. 12, no. 9, pp. 865-874, Sept. 2001, doi:10.1109/71.954617
Usage of this product signifies your acceptance of the Terms of Use.