A distributed mutual exclusion solution derived from real-life examples

Authors:
Rajeev Chawla
Affiliations:
Virginia Commonwealth University, Richmond, VA
Venue:
ACM-SE 30 Proceedings of the 30th annual Southeast regional conference
Year:
1992

Citing 8
Cited 0

How to assign votes in a distributed system

Journal of the ACM (JACM)
A tree-based algorithm for distributed mutual exclusion

ACM Transactions on Computer Systems (TOCS)
A Heuristically-Aided Algorithm for Mutual Exclusion in Distributed Systems

IEEE Transactions on Computers
An efficient and fault-tolerant solution 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

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper presents a distributed mutual exclusion solution which is derived from a real-life situation which requires mutual exclusion. The proposed algorithm uses a dynamic information structure and requires between 0 and N message exchanges per critical section invocation, where N is the number of nodes in the network. The algorithm is also proved to be free from deadlock and starvation.