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 publicationProc Eighth ACM Symp Princ Distrib Comput
PublisherPubl by ACM
Pages193-200
Number of pages8
ISBN (Print)0897913264
Publication statusPublished - 1 Dec 1989
EventProceedings of the Eighth Annual ACM Symposium on Principles of Distributed Computing - Edmonton, Alberta, Can
Duration: 14 Aug 198916 Aug 1989

Publication series

NameProceedings of the Annual ACM Symposium on Principles of Distributed Computing

Other

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

    Fingerprint

ASJC Scopus subject areas

  • Software
  • Hardware and Architecture
  • Computer Networks and Communications

Cite this

Agrawal, D., & El Abbadi, A. (1989). Efficient solution to the distributed mutual exclusion problem (preliminary report). In Proc Eighth ACM Symp Princ Distrib Comput (pp. 193-200). (Proceedings of the Annual ACM Symposium on Principles of Distributed Computing). Publ by ACM.