This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Composite k-Arbiters
November 2001 (vol. 12 no. 11)
pp. 1134-1145

Abstract—The k-Arbiter is a useful concept to solve the distributed h-out-of-k mutual exclusion problem. The distributed h-out-of-k mutual exclusion algorithms, based on the k-arbiter, have the benefits of high fault tolerance and low message cost. However, according to the definition of the k-arbiter, it is required to have a nonempty intersection among any (k+1) quorums in a k-arbiter. Consequently, constructing k-arbiters is difficult. The coterie join operation proposed by Neilsen and Mizuno produces a new and larger coterie by joining known coteries. In this paper, by extending the coterie join operation, we first propose a k-arbiter join operation to construct a new and larger k-arbiter from known k-arbiters for a large system. Then, we derive a necessary and sufficient condition for the k-arbiter join operation to construct a nondominated joined k-arbiter. Moreover, we discuss availability properties of the joined k-arbiters. We observe that, by selecting proper k-arbiters, the joined k-arbiter can provide a higher availability than that of the original input. Finally, we propose a k-arbiter compound operation to construct k-arbiters by using coteries and/or k-coteries. By that way, the problem of constructing k-arbiters can be reduced to the problem of constructing coteries and/or k-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] 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.
[3] T. Harada and M. Yamashita, Coterie Join Operation and Tree Structuredk-Coteries IEEE Trans. Parallel and Distributed Systems, vol. 12, no. 9, pp. 865-874, Sept. 2001.
[4] 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.
[5] 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.
[6] 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.
[7] 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.
[8] Y.C. Kuo, “Nondominated (K,M)-Coteries for the DistributedK-out-of-MResources Allocation Problem,” SooChow J. Economics and Business, no. 27, pp. 107-127, Dec. 1999.
[9] 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.
[10] Y.C. Kuo and S.T. Huang, “Recognizing Nondominated Coteries andwr-Coteries by Availability,” IEEE Trans. Parallel and Distributed Systems, vol. 9, no. 8, pp. 721-728, Aug. 1998.
[11] 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.
[12] Y. Manabe, R. Baldoni, M. Raynal, and S. Aoyagi, “k-Arbiter: A Aafe and General Scheme forh-out of-kMutual Exclusion,” Theoretical Computer Science, vol. 193, no. 1-2, pp. 97-112, Feb. 1998.
[13] M.L. Nielsen and M. Mizuno,“Coterie join algorithm,” IEEE Trans. Parallel and Distributed Systems, vol. 3, no. 5, pp. 582-590, Sept. 1992.
[14] M.L. Neilsen and M. Mizuno, “Nondominatedk-Coteries for Multiple Mutual Exclusion,” Information Processing Letters, vol. 50, no. 5, pp. 247-252, June 1994.
[15] K. Raymond, "A Distributed Algorithm for Multiple Entries to a Critical Section," Information Processing Letters, vol. 30, no. 4, pp. 189-193, Feb. 1989.
[16] M. Raynal, “A Distributed Solution to thek-out of-MResources Allocation Problem,” Lecture Notes Computer Science, no. 497, Springer-Verlag, pp. 599-609, 1991.
[17] ——,“A simple taxonomy for distributed mutual exclusion algorithms,”Oper. Syst. Rev.,vol. 25, no. 2, pp. 47–50, 1991.
[18] 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:
Distributed systems, fault tolerance, h-out-of-k mutual exclusion, permission-based algorithms, quorums.
Citation:
Yu-Chen Kuo, "Composite k-Arbiters," IEEE Transactions on Parallel and Distributed Systems, vol. 12, no. 11, pp. 1134-1145, Nov. 2001, doi:10.1109/71.969124
Usage of this product signifies your acceptance of the Terms of Use.