Analysis of quorum-based protocols for distributed (k+1)-exclusion | Zendy

Divyakant Agrawal | Zendy; Ömer Eğecioǧlu | Zendy; Amr El Abbadi | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Analysis of quorum-based protocols for distributed (k+1)-exclusion

Author(s) -

Divyakant Agrawal,

Ömer Eğecioǧlu,

Amr El Abbadi

Publication year - 1995

Publication title -

lecture notes in computer science

Language(s) - English

Resource type - Book series

SCImago Journal Rank - 0.249

H-Index - 400

eISSN - 1611-3349

pISSN - 0302-9743

DOI - 10.1007/bfb0030830

Subject(s) - generalization , computer science , scheme (mathematics) , mutual exclusion , distributed computing , theoretical computer science , algorithm , mathematics , mathematical analysis

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.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research