Efficient solution to the distributed mutual exclusion problem (preliminary report)

Divyakant Agrawal, Amr El Abbadi

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

42 Citations (Scopus)

Abstract

We present an efficient fault-tolerant solution to the distributed mutual exclusion problem. Our protocol requires log n messages in the best case and is resilient to both site and communication failures, even when such failures lead to network partitioning. Furthermore, the protocol exhibits a property of graceful degradation, i.e., it requires more message only as the number of failures increase in the network.

Original languageEnglish
Title of host publicationProceedings of the Annual ACM Symposium on Principles of Distributed Computing
Place of PublicationNew York, NY, United States
PublisherPubl by ACM
Pages193-200
Number of pages8
ISBN (Print)0897913264
Publication statusPublished - 1 Dec 1989
Externally publishedYes
EventProceedings of the Eighth Annual ACM Symposium on Principles of Distributed Computing - Edmonton, Alberta, Can
Duration: 14 Aug 198916 Aug 1989

Other

OtherProceedings of the Eighth Annual ACM Symposium on Principles of Distributed Computing
CityEdmonton, Alberta, Can
Period14/8/8916/8/89

Fingerprint

Degradation
Communication

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Hardware and Architecture

Cite this

Agrawal, D., & El Abbadi, A. (1989). Efficient solution to the distributed mutual exclusion problem (preliminary report). In Proceedings of the Annual ACM Symposium on Principles of Distributed Computing (pp. 193-200). New York, NY, United States: Publ by ACM.

Efficient solution to the distributed mutual exclusion problem (preliminary report). / Agrawal, Divyakant; El Abbadi, Amr.

Proceedings of the Annual ACM Symposium on Principles of Distributed Computing. New York, NY, United States : Publ by ACM, 1989. p. 193-200.

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

Agrawal, D & El Abbadi, A 1989, Efficient solution to the distributed mutual exclusion problem (preliminary report). in Proceedings of the Annual ACM Symposium on Principles of Distributed Computing. Publ by ACM, New York, NY, United States, pp. 193-200, Proceedings of the Eighth Annual ACM Symposium on Principles of Distributed Computing, Edmonton, Alberta, Can, 14/8/89.
Agrawal D, El Abbadi A. Efficient solution to the distributed mutual exclusion problem (preliminary report). In Proceedings of the Annual ACM Symposium on Principles of Distributed Computing. New York, NY, United States: Publ by ACM. 1989. p. 193-200
Agrawal, Divyakant ; El Abbadi, Amr. / Efficient solution to the distributed mutual exclusion problem (preliminary report). Proceedings of the Annual ACM Symposium on Principles of Distributed Computing. New York, NY, United States : Publ by ACM, 1989. pp. 193-200
@inproceedings{d1023baeb5394cfd9f2ab8b5312b0bd7,
title = "Efficient solution to the distributed mutual exclusion problem (preliminary report)",
abstract = "We present an efficient fault-tolerant solution to the distributed mutual exclusion problem. Our protocol requires log n messages in the best case and is resilient to both site and communication failures, even when such failures lead to network partitioning. Furthermore, the protocol exhibits a property of graceful degradation, i.e., it requires more message only as the number of failures increase in the network.",
author = "Divyakant Agrawal and {El Abbadi}, Amr",
year = "1989",
month = "12",
day = "1",
language = "English",
isbn = "0897913264",
pages = "193--200",
booktitle = "Proceedings of the Annual ACM Symposium on Principles of Distributed Computing",
publisher = "Publ by ACM",

}

TY - GEN

T1 - Efficient solution to the distributed mutual exclusion problem (preliminary report)

AU - Agrawal, Divyakant

AU - El Abbadi, Amr

PY - 1989/12/1

Y1 - 1989/12/1

N2 - We present an efficient fault-tolerant solution to the distributed mutual exclusion problem. Our protocol requires log n messages in the best case and is resilient to both site and communication failures, even when such failures lead to network partitioning. Furthermore, the protocol exhibits a property of graceful degradation, i.e., it requires more message only as the number of failures increase in the network.

AB - We present an efficient fault-tolerant solution to the distributed mutual exclusion problem. Our protocol requires log n messages in the best case and is resilient to both site and communication failures, even when such failures lead to network partitioning. Furthermore, the protocol exhibits a property of graceful degradation, i.e., it requires more message only as the number of failures increase in the network.

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

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

M3 - Conference contribution

SN - 0897913264

SP - 193

EP - 200

BT - Proceedings of the Annual ACM Symposium on Principles of Distributed Computing

PB - Publ by ACM

CY - New York, NY, United States

ER -