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

Divyakant Agrawal, Omer Eğecioğlu, Amr E1 Abbadi

Research output: Chapter in Book/Report/Conference proceedingConference contribution

3 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.

Original languageEnglish
Title of host publicationLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
PublisherSpringer Verlag
Pages161-170
Number of pages10
Volume959
ISBN (Print)354060216X, 9783540602163
DOIs
Publication statusPublished - 1995
Externally publishedYes
Event1st Annual International Computing and Combinatorics Conference, COCOON 1995 - Xi’an, China
Duration: 24 Aug 199526 Aug 1995

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume959
ISSN (Print)03029743
ISSN (Electronic)16113349

Other

Other1st Annual International Computing and Combinatorics Conference, COCOON 1995
CountryChina
CityXi’an
Period24/8/9526/8/95

Fingerprint

Quorum
Availability
Divisor
Extremes
Interpolate
Costs

ASJC Scopus subject areas

  • Computer Science(all)
  • Theoretical Computer Science

Cite this

Agrawal, D., Eğecioğlu, O., & Abbadi, A. E. (1995). Analysis of quorum-based protocols for distributed (k+l)-exclusion. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 959, pp. 161-170). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 959). Springer Verlag. https://doi.org/10.1007/BFb0030830

Analysis of quorum-based protocols for distributed (k+l)-exclusion. / Agrawal, Divyakant; Eğecioğlu, Omer; Abbadi, Amr E1.

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 959 Springer Verlag, 1995. p. 161-170 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 959).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Agrawal, D, Eğecioğlu, O & Abbadi, AE 1995, Analysis of quorum-based protocols for distributed (k+l)-exclusion. in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). vol. 959, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 959, Springer Verlag, pp. 161-170, 1st Annual International Computing and Combinatorics Conference, COCOON 1995, Xi’an, China, 24/8/95. https://doi.org/10.1007/BFb0030830
Agrawal D, Eğecioğlu O, Abbadi AE. Analysis of quorum-based protocols for distributed (k+l)-exclusion. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 959. Springer Verlag. 1995. p. 161-170. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/BFb0030830
Agrawal, Divyakant ; Eğecioğlu, Omer ; Abbadi, Amr E1. / Analysis of quorum-based protocols for distributed (k+l)-exclusion. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 959 Springer Verlag, 1995. pp. 161-170 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{b4dd41cf53744ad9a4aba26b5d04e7aa,
title = "Analysis of quorum-based protocols for distributed (k+l)-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.",
author = "Divyakant Agrawal and Omer Eğecioğlu and Abbadi, {Amr E1}",
year = "1995",
doi = "10.1007/BFb0030830",
language = "English",
isbn = "354060216X",
volume = "959",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "161--170",
booktitle = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

}

TY - GEN

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

AU - Agrawal, Divyakant

AU - Eğecioğlu, Omer

AU - Abbadi, Amr E1

PY - 1995

Y1 - 1995

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.

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.

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

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

U2 - 10.1007/BFb0030830

DO - 10.1007/BFb0030830

M3 - Conference contribution

SN - 354060216X

SN - 9783540602163

VL - 959

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 161

EP - 170

BT - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

PB - Springer Verlag

ER -