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

Divyakant Agrawal, Ömer Eǧecioǧlu, Amr El Abbadi

Research output: Contribution to journalArticle

12 Citations (Scopus)

Abstract

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. An interesting implication of this analysis is that in a reasonably reliable environment with a large number of sites, even protocols with low communication costs attain high availability.

Original languageEnglish
Pages (from-to)533-537
Number of pages5
JournalIEEE Transactions on Parallel and Distributed Systems
Volume8
Issue number5
DOIs
Publication statusPublished - 1 Dec 1997
Externally publishedYes

Fingerprint

Quorum
Availability
High Availability
Communication Cost
Divisor
Costs
Extremes
Interpolate
Communication

Keywords

  • Distributed systems
  • Fault-tolerance
  • Mutual exclusion
  • Replicated data

ASJC Scopus subject areas

  • Electrical and Electronic Engineering
  • Theoretical Computer Science
  • Computational Theory and Mathematics

Cite this

Analysis of quorum-based protocols for distributed (k + 1)-exclusion. / Agrawal, Divyakant; Eǧecioǧlu, Ömer; El Abbadi, Amr.

In: IEEE Transactions on Parallel and Distributed Systems, Vol. 8, No. 5, 01.12.1997, p. 533-537.

Research output: Contribution to journalArticle

Agrawal, Divyakant ; Eǧecioǧlu, Ömer ; El Abbadi, Amr. / Analysis of quorum-based protocols for distributed (k + 1)-exclusion. In: IEEE Transactions on Parallel and Distributed Systems. 1997 ; Vol. 8, No. 5. pp. 533-537.
@article{0b2fece53eeb45b5999b43f8451bcd2f,
title = "Analysis of quorum-based protocols for distributed (k + 1)-exclusion",
abstract = "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. An interesting implication of this analysis is that in a reasonably reliable environment with a large number of sites, even protocols with low communication costs attain high availability.",
keywords = "Distributed systems, Fault-tolerance, Mutual exclusion, Replicated data",
author = "Divyakant Agrawal and {\"O}mer Eǧecioǧlu and {El Abbadi}, Amr",
year = "1997",
month = "12",
day = "1",
doi = "10.1109/71.598279",
language = "English",
volume = "8",
pages = "533--537",
journal = "IEEE Transactions on Parallel and Distributed Systems",
issn = "1045-9219",
publisher = "IEEE Computer Society",
number = "5",

}

TY - JOUR

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

AU - Agrawal, Divyakant

AU - Eǧecioǧlu, Ömer

AU - El Abbadi, Amr

PY - 1997/12/1

Y1 - 1997/12/1

N2 - 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. An interesting implication of this analysis is that in a reasonably reliable environment with a large number of sites, even protocols with low communication costs attain high availability.

AB - 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. An interesting implication of this analysis is that in a reasonably reliable environment with a large number of sites, even protocols with low communication costs attain high availability.

KW - Distributed systems

KW - Fault-tolerance

KW - Mutual exclusion

KW - Replicated data

UR - http://www.scopus.com/inward/record.url?scp=0031144129&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0031144129&partnerID=8YFLogxK

U2 - 10.1109/71.598279

DO - 10.1109/71.598279

M3 - Article

VL - 8

SP - 533

EP - 537

JO - IEEE Transactions on Parallel and Distributed Systems

JF - IEEE Transactions on Parallel and Distributed Systems

SN - 1045-9219

IS - 5

ER -