An Efficient and Fault-Tolerant Solution for Distributed Mutual Exclusion

Divyakant Agrawal, Amr El Abbadi

Research output: Contribution to journalArticle

221 Citations (Scopus)

Abstract

In this paper, we present an efficient and fault-tolerant algorithm for generating quorums to solve the distributed mutual exclusion problem. The algorithm uses a logical tree organization of the network to generate tree quorums, which are logarithmic in the size of the network in the best case. Our approach is resilient to both site and communication failures, even when such failures lead to network partitioning. Furthermore, the algorithm exhibits a property of graceful degradation, i.e., it requires more messages only as the number of failures increase in the network. We describe how tree quorums can be used for various distributed applications for providing mutually exclusive access to a distributed resource, managing replicated objects, and atomically commiting a distributed transaction.

Original languageEnglish
Pages (from-to)1-20
Number of pages20
JournalACM Transactions on Computer Systems
Volume9
Issue number1
DOIs
Publication statusPublished - 2 Jan 1991
Externally publishedYes

Fingerprint

Degradation
Communication

ASJC Scopus subject areas

  • Computer Science(all)

Cite this

An Efficient and Fault-Tolerant Solution for Distributed Mutual Exclusion. / Agrawal, Divyakant; El Abbadi, Amr.

In: ACM Transactions on Computer Systems, Vol. 9, No. 1, 02.01.1991, p. 1-20.

Research output: Contribution to journalArticle

Agrawal, Divyakant ; El Abbadi, Amr. / An Efficient and Fault-Tolerant Solution for Distributed Mutual Exclusion. In: ACM Transactions on Computer Systems. 1991 ; Vol. 9, No. 1. pp. 1-20.
@article{c890246ad3c845ed9eda922326d0324f,
title = "An Efficient and Fault-Tolerant Solution for Distributed Mutual Exclusion",
abstract = "In this paper, we present an efficient and fault-tolerant algorithm for generating quorums to solve the distributed mutual exclusion problem. The algorithm uses a logical tree organization of the network to generate tree quorums, which are logarithmic in the size of the network in the best case. Our approach is resilient to both site and communication failures, even when such failures lead to network partitioning. Furthermore, the algorithm exhibits a property of graceful degradation, i.e., it requires more messages only as the number of failures increase in the network. We describe how tree quorums can be used for various distributed applications for providing mutually exclusive access to a distributed resource, managing replicated objects, and atomically commiting a distributed transaction.",
author = "Divyakant Agrawal and {El Abbadi}, Amr",
year = "1991",
month = "1",
day = "2",
doi = "10.1145/103727.103728",
language = "English",
volume = "9",
pages = "1--20",
journal = "ACM Transactions on Computer Systems",
issn = "0734-2071",
publisher = "Association for Computing Machinery (ACM)",
number = "1",

}

TY - JOUR

T1 - An Efficient and Fault-Tolerant Solution for Distributed Mutual Exclusion

AU - Agrawal, Divyakant

AU - El Abbadi, Amr

PY - 1991/1/2

Y1 - 1991/1/2

N2 - In this paper, we present an efficient and fault-tolerant algorithm for generating quorums to solve the distributed mutual exclusion problem. The algorithm uses a logical tree organization of the network to generate tree quorums, which are logarithmic in the size of the network in the best case. Our approach is resilient to both site and communication failures, even when such failures lead to network partitioning. Furthermore, the algorithm exhibits a property of graceful degradation, i.e., it requires more messages only as the number of failures increase in the network. We describe how tree quorums can be used for various distributed applications for providing mutually exclusive access to a distributed resource, managing replicated objects, and atomically commiting a distributed transaction.

AB - In this paper, we present an efficient and fault-tolerant algorithm for generating quorums to solve the distributed mutual exclusion problem. The algorithm uses a logical tree organization of the network to generate tree quorums, which are logarithmic in the size of the network in the best case. Our approach is resilient to both site and communication failures, even when such failures lead to network partitioning. Furthermore, the algorithm exhibits a property of graceful degradation, i.e., it requires more messages only as the number of failures increase in the network. We describe how tree quorums can be used for various distributed applications for providing mutually exclusive access to a distributed resource, managing replicated objects, and atomically commiting a distributed transaction.

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

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

U2 - 10.1145/103727.103728

DO - 10.1145/103727.103728

M3 - Article

VL - 9

SP - 1

EP - 20

JO - ACM Transactions on Computer Systems

JF - ACM Transactions on Computer Systems

SN - 0734-2071

IS - 1

ER -