A Tree-Based Algorithm for Distributed Mutual Exclusion


We present an algorithm for distributed mutual exclusion in a computer network of N nodes that communicate by messages rather than shared memory. The algorithm uses a spanning tree of the computer network, and the number of messages exchanged per critical section depends on the topology of this tree. However, typically the number of messages exchanged is O… (More)
DOI: 10.1145/58564.59295

4 Figures and Tables



Citations per Year

482 Citations

Semantic Scholar estimates that this publication has 482 citations based on the available data.

See our FAQ for additional information.

  • Presentations referencing similar topics