An algorithm for concurrency control and recovery in replicated distributed databases
ACM Transactions on Database Systems (TODS)
How to assign votes in a distributed system
Journal of the ACM (JACM)
Consistency in a partitioned network: a survey
ACM Computing Surveys (CSUR)
The vulnerability of vote assignments
ACM Transactions on Computer Systems (TOCS)
Algorithms for mutual exclusion
Algorithms for mutual exclusion
The information structure of distributed mutual exclusion algorithms
ACM Transactions on Computer Systems (TOCS)
The Reliability of Voting Mechanisms
IEEE Transactions on Computers
Synchronization of replicated data in distributed systems
Information Systems
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 algorithm for multiple entries to a critical section
Information Processing Letters
A Heuristically-Aided Algorithm for Mutual Exclusion in Distributed Systems
IEEE Transactions on Computers
Increasing availability under mutual exclusion constraints with dynamic vote reassignment
ACM Transactions on Computer Systems (TOCS)
Dynamic voting algorithms for maintaining the consistency of a replicated database
ACM Transactions on Database Systems (TODS)
An efficient and fault-tolerant solution for distributed mutual exclusion
ACM Transactions on Computer Systems (TOCS)
ACM Transactions on Computer Systems (TOCS)
A simple taxonomy for distributed mutual exclusion algorithms
ACM SIGOPS Operating Systems Review
Hierarchical Quorum Consensus: A New Algorithm for Managing Replicated Data
IEEE Transactions on Computers
SIGMOD '92 Proceedings of the 1992 ACM SIGMOD international conference on Management of data
A high availability N hierarchical grid algorithm for replicated data
Information Processing Letters
Another distributed algorithm for multiple entries to a critical section
Information Processing Letters
The generalized tree quorum protocol: an efficient approach for managing replicated data
ACM Transactions on Database Systems (TODS)
A taxonomy of distributed mutual exclusion
Journal of Parallel and Distributed Computing
A distributed k-mutual exclusion algorithm using k-coterie
Information Processing Letters
Optimal coteries and voting schemes
Information Processing Letters
Nondominated k-coteries for multiple mutual exclusion
Information Processing Letters
A General Scheme for Token- and Tree-Based Distributed Mutual Exclusion Algorithms
IEEE Transactions on Parallel and Distributed Systems
Comments on "Availability of k-Coterie"
IEEE Transactions on Computers
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)
A Fault-Tolerant Algorithm for Replicated Data Management
IEEE Transactions on Parallel and Distributed Systems
The availability of quorum systems
Information and Computation
A simulation study on distributed mutual exclusion
Journal of Parallel and Distributed Computing
Folded Petersen Cube Networks: New Competitors for the Hypercubes
IEEE Transactions on Parallel and Distributed Systems
A fast token-chasing mutual exclusion algorithm in arbitrary network topologies
Journal of Parallel and Distributed Computing
A log (N) distributed mutual exclusion algorithm based on path reversal
Journal of Parallel and Distributed Computing
A simple scheme to construct k-coteries with ON uniform quorum sizes
Information Processing Letters
Cohorts Structures for Fault-Tolerant k Entries to a Critical Section
IEEE Transactions on Computers
A Geometric Approach for Constructing Coteries and k-Coteries
IEEE Transactions on Parallel and Distributed Systems
Properties of nondominated k-coteries
Journal of Systems and Software
Delay-Optimal Quorum Consensus for Distributed Systems
IEEE Transactions on Parallel and Distributed Systems
Analysis of Quorum-Based Protocols for Distributed (k + 1)-Exclusion
IEEE Transactions on Parallel and Distributed Systems
k-Arbiter: a safe and general scheme for h-out of-k mutual exclusion
Theoretical Computer Science
Recognizing Nondominated Coteries and wr-Coteries by Availability
IEEE Transactions on Parallel and Distributed Systems
Optimal availability quorum systems: theory and practice
Information Processing Letters
A quorum based k-mutual exclusion by weighted k-quorum systems
Information Processing Letters
Minimizing the Maximum Delay for Reaching Consensus in Quorum-Based Mutual Exclusion Schemes
IEEE Transactions on Parallel and Distributed Systems
Distributed systems (2nd Ed.)
A performance comparison of token- and tree-based mutual exclusion algorithms on chordal rings
Journal of Network and Computer Applications
A token-based delay optimal algorithm for mutual exclusion in distributed systems
Computer Standards & Interfaces
A Majority consensus approach to concurrency control for multiple copy databases
ACM Transactions on Database Systems (TODS)
The Byzantine Generals Problem
ACM Transactions on Programming Languages and Systems (TOPLAS)
Fail-stop processors: an approach to designing fault-tolerant computing 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
Further comments on Dijkstra's concurrent programming control problem
Communications of the ACM
Additional comments on a problem in concurrent programming control
Communications of the ACM
Additional comments on a problem in concurrent programming control
Communications of the ACM
Coterie Join Operation and Tree Structured k-Coteries
IEEE Transactions on Parallel and Distributed Systems
Delay optimal coteries on regular symmetric networks
Computer Standards & Interfaces
Minimizing the mean delay of quorum-based mutual exclusion schemes
Journal of Systems and Software
Distributed Systems: Concepts and Design
Distributed Systems: Concepts and Design
Operating System Concepts
IEEE Transactions on Computers
Optimizing Vote and Quorum Assignments for Reading and Writing Replicated Data
IEEE Transactions on Knowledge and Data Engineering
The Grid Protocol: A High Performance Scheme for Maintaining Replicated Data
IEEE Transactions on Knowledge and Data Engineering
A Dynamic Information-Structure Mutual Exclusion Algorithm for Distributed Systems
IEEE Transactions on Parallel and Distributed Systems
IEEE Transactions on Parallel and Distributed Systems
A Theory of Coteries: Mutual Exclusion in Distributed Systems
IEEE Transactions on Parallel and Distributed Systems
Voting as the Optimal Static Pessimistic Scheme for Managing Replicated Data
IEEE Transactions on Parallel and Distributed Systems
Generating and Approximating Nondominated Coteries
IEEE Transactions on Parallel and Distributed Systems
Nondominated Coteries on Graphs
IEEE Transactions on Parallel and Distributed Systems
IEEE Transactions on Parallel and Distributed Systems
Weighted voting for replicated data
SOSP '79 Proceedings of the seventh ACM symposium on Operating systems principles
An Extended Binary Tree Quorum Strategy for K-Mutual Exclusion in Distributed Systems
PRFTS '97 Proceedings of the 1997 Pacific Rim International Symposium on Fault-Tolerant Systems
On the Availability of k-Coteries in Networks with Unreliable Nodes and Links
WORDS '99 Proceedings of the Fourth International Workshop on Object-Oriented Real-Time Dependable Systems
Two New Quorum Based Algorithms for Distributed Mutual Exclusion
ICDCS '97 Proceedings of the 17th International Conference on Distributed Computing Systems (ICDCS '97)
A Delay-Optimal Quorum-Based Mutual Exclusion Scheme with Fault-Tolerance Capability
ICDCS '98 Proceedings of the The 18th International Conference on Distributed Computing Systems
Cost Optimal Coteries
Optimal coteries for rings and related networks
Distributed Computing
ICCC'11 Proceedings of the 2011 international conference on Computers and computing
A novel distributed scheduling algorithm for resource sharing under near-heavy load
OPODIS'04 Proceedings of the 8th international conference on Principles of Distributed Systems
Info-based approach in distributed mutual exclusion algorithms
Journal of Parallel and Distributed Computing
| Hi-index | 0.00 |
The problem of mutual exclusion in distributed systems has attracted considerable attention over the last two decades. The mutual exclusion problem requires that, at a time, only one of the contending processes be allowed to enter its critical section (CS). A number of solutions have been provided to the mutual exclusion problem in distributed systems. Different algorithms have used different techniques to achieve mutual exclusion and have different performances. Depending on the technique used, these algorithms have been classified as token-based and permission-based algorithms. In this paper, we present a survey of various permission-based distributed mutual exclusion (PBDME) algorithms and their comparative performance.