Analysis of Quorum-Based Protocols for Distributed (k+1)-Exclusion

A generalization of the majority quorum for the solution of the distributed (k+1)-exclusion problem is proposed. This scheme produces a family of quorums of varying sizes and availabilities indexed by integral divisors r of k. The cases r=1 and r=k correspond to known majority based quorum generation algorithms MAJ and DIV, whereas intermediate values of r interpolate between these two extremes. A cost and availability analysis of the proposed methods is also presented.

[1]  Satish K. Tripathi,et al.  A Robust Distributed Mutual Exclusion Algorithm , 1991, WDAG.

[2]  Shing-Tsaan Huang,et al.  k-coteries for fault-tolerant k entries to a critical section , 1993, [1993] Proceedings. The 13th International Conference on Distributed Computing Systems.

[3]  Hector Garcia-Molina,et al.  How to assign votes in a distributed system , 1985, JACM.

[4]  Mamoru Maekawa,et al.  A N algorithm for mutual exclusion in decentralized systems , 1985, TOCS.

[5]  Arthur J. Bernstein,et al.  Bounded ignorance in replicated systems , 1991, PODS.

[6]  Richard D. Schlichting,et al.  Fail-stop processors: an approach to designing fault-tolerant computing systems , 1983, TOCS.

[7]  Daniel I. A. Cohen,et al.  Basic techniques of combinatorial theory , 1978 .

[8]  Satoshi Fujita,et al.  Availability of k-Coterie , 1993, IEEE Trans. Computers.

[9]  Pradip K. Srimani,et al.  Another Distributed Algorithm for Multiple Entries to a Critical Section , 1992, Inf. Process. Lett..

[10]  Mostafa H. Ammar,et al.  Performance Characterization of Quorum-Consensus Algorithms for Replicated Data , 1989, IEEE Trans. Software Eng..

[11]  Kerry Raymond.  A Distributed Algorithm for Multiple Entries to a Critical Section , 1989, Inf. Process. Lett..

[12]  John Riordan,et al.  Introduction to Combinatorial Analysis , 1959 .

[13]  Ichiro Suzuki,et al.  A distributed mutual exclusion algorithm , 1985, TOCS.

[14]  MaekawaMamoru.  A √N algorithm for mutual exclusion in decentralized systems , 1985 .

[15]  Robert H. Thomas,et al.  A Majority consensus approach to concurrency control for multiple copy databases , 1979, ACM Trans. Database Syst..

[16]  Divyakant Agrawal,et al.  Exploiting Logical Structures in Replicated Databases , 1990, Inf. Process. Lett..

[17]  Satoshi Fujita,et al.  Distributed k-Mutual Exclusion Problem and k-Coteries , 1991, ISA.

[18]  Shyan-Ming Yuan,et al.  Comments on "Availability of k-Coterie" , 1994, IEEE Trans. Computers.

[19]  Akhil Kumar,et al.  Hierarchical Quorum Consensus: A New Algorithm for Managing Replicated Data , 1991, IEEE Trans. Computers.

[20]  John Riordan,et al.  Introduction to Combinatorial Analysis , 1958 .

[21]  Ashok K. Agrawala,et al.  An optimal algorithm for mutual exclusion in computer networks , 1981, CACM.

[22]  Divyakant Agrawal,et al.  An efficient and fault-tolerant solution for distributed mutual exclusion , 1991, TOCS.

[23]  Ömer Egecioglu,et al.  Analysis of Quorum-Based Protocols for Distributed (k+1)-Exclusion , 1997, IEEE Trans. Parallel Distributed Syst..

[24]  David K. Gifford,et al.  Weighted voting for replicated data , 1979, SOSP '79.