Distributed computing: Optimal algorithm for mutual exclusion in mesh-connected computer networks

Authors:
Pranay Chaudhuri
Affiliations:
School of Computer Science and Engineering, The University of New South Wales, PO Box 1, Kensington, NSW 2033, Australia
Venue:
Computer Communications
Year:
1991

Citing 8
Cited 0

A distributed algorithm for mutual exclusion in an arbitrary network

The Computer Journal
A tree-based algorithm for distributed mutual exclusion

ACM Transactions on Computer Systems (TOCS)
A distributed mutual exclusion algorithm

ACM Transactions on Computer Systems (TOCS)
A N algorithm for mutual exclusion in decentralized systems

ACM Transactions on Computer Systems (TOCS)
An optimal algorithm for mutual exclusion in computer networks

Communications of the ACM
Time, clocks, and the ordering of events in a distributed system

Communications of the ACM
Operating system principles

Operating system principles
Operating Systems Theory

Operating Systems Theory

Quantified Score

Hi-index	0.24

Visualization

Abstract

A distributed algorithm is presented that realizes mutual exclusion among n nodes in a mesh-connected computer network. The nodes communicate by using messages only, and there is no global controller. The algorithm requires at most 3.5 @/n messages per mutual exclusion invocation under light demand, and reduces to approximately four messages under heavy demand. The time required to achieve mutual exclusion is shown to be minimal under some general assumptions.