Fault-tolerant mutual exclusion algorithms

https://doi.org/10.1016/0164-1212(90)90056-RGet rights and content

Abstract

A distributed computing system or a computer network consists of an interconnection of a set of N independently running computer systems called the nodes of the network. These nodes communicate among themselves only by exchanging messages. In this paper, we propose two different fault-tolerant distributed mutual exclusion algorithms that can establish mutual exclusion in such a distributed environment even when the member nodes fail, and we evaluate their relative performance.

References (9)

  • G. Ricart et al.

    An Optimal Algorithm for Mutual Exclusion in Computer Networks

    Commun. ACM

    (1981)
  • I. Suzuki et al.

    A Distributed Mutual Exclusion Algorithm

    ACM Trans. Comput. Syst.

    (1985)
  • L. Lamport

    Time, Clocks and the Ordering of Events in a Distributed System

    Commun. of ACM

    (197)
  • D.K. Gifford

    Weighted Voting for Replicated Data

There are more references available in the full text version of this article.

Cited by (6)

View full text