Corpus ID: 18513471

Chapter 9 Distributed Mutual Exclusion Algorithms

@inproceedings{Kshemkalyani2009Chapter9D,
  title={Chapter 9 Distributed Mutual Exclusion Algorithms},
  author={A. Kshemkalyani and M. Singhal},
  year={2009}
}
Mutual exclusion is a fundamental problem in distributed computing systems. Mutual exclusion ensures that concurrent access of processes to a shared resource or data is serialized, that is, executed in mutually exclusive manner. Mutual exclusion in a distributed system states that only one process is allowed to execute the critical section (CS) at any given time. In a distributed system, shared variables (semaphores) or a local kernel cannot be used to implement mutual exclusion. Message… Expand

Figures from this paper

A Robust Permission-Based Hierarchical Distributed k-Mutual Exclusion Algorithm
TLDR
This work introduces a novel permission-based k-mutual exclusion algorithm for distributed systems with crash faults that is proven to guarantee the safety and liveness of the concurrent access of n processes to k critical resources. Expand

References

SHOWING 1-10 OF 30 REFERENCES
Two Algorithms for Mutual Exclusion in Real-Time Distributed Computer Systems
  • A. Goscinski
  • Computer Science
  • J. Parallel Distributed Comput.
  • 1990
TLDR
Two algorithms developed utilizing a priority-based event-ordering which manage mutual exclusion in distributed systems—computer networks—are proposed, which are fully distributed and are insensitive to the relative speeds of node computers and communication links. Expand
A Heuristically-Aided Algorithm for Mutual Exclusion in Distributed Systems
  • M. Singhal
  • Computer Science
  • IEEE Trans. Computers
  • 1989
TLDR
A heuristically-aided algorithm to achieve mutual exclusion in distributed systems is presented which has better performance characteristics than previously proposed algorithms and is free from deadlock and starvation. Expand
A Fair Distributed Mutual Exclusion Algorithm
This paper presents a fair decentralized mutual exclusion algorithm for distributed systems in which processes communicate by asynchronous message passing. The algorithm requires between N-1 andExpand
A dynamic token-based distributed mutual exclusion algorithm
  • Ye-In Chang, M. Singhal, M. T. Liu
  • Computer Science
  • [1991 Proceedings] Tenth Annual International Phoenix Conference on Computers and Communications
  • 1991
TLDR
The authors present a dynamic token-based mutual exclusion algorithm for distributed systems that can reduce the number of the messages exchanged by 40% when the traffic is light and dynamic because the request set is dynamically changed as the algorithm is executed. Expand
A survey of permission-based distributed mutual exclusion algorithms
TLDR
This paper presents a survey of various permission-based distributed mutual exclusion (PBDME) algorithms and their comparative performance. Expand
An optimal algorithm for mutual exclusion in computer networks
TLDR
An algorithm is proposed that creates mutual exclusion in a computer network whose nodes communicate only by messages and do not share memory, and it is shown that the number can be contained in a fixed amount of memory by storing it as the residue of a modulus. Expand
A Resilient Mutual Exclusion Algorithm for Computer Networks
TLDR
The authors present an extension to the work of I. Suzuki and T. Kasami, where a mutual exclusion algorithm uses a message called a token to transfer the privilege of entering a critical region among the participating sites by guaranteeing regeneration of only one token in the network. Expand
A distributed mutual exclusion algorithm
A distributed algorithm is presented that realizes mutual exclusion among N nodes in a computer network. The algorithm requires at most N message exchanges for one mutual exclusion invocation.Expand
A Delay-Optimal Quorum-Based Mutual Exclusion Algorithm for Distributed Systems
TLDR
A delay-optimal quorum-based mutual exclusion algorithm which reduces the synchronization delay to T and still has a low message complexity of O(K) (K is the size of the quorum which can be as low as log N). Expand
A fault tolerant algorithm for distributed mutual exclusion
TLDR
There is a tradeoff between efficiency and reliability, and a system can be designed to balance these two criteria properly and achieve a higher degree of fault tolerance at the expense of increased message traffic. Expand
...
1
2
3
...