How to assign votes in a distributed system
Journal of the ACM (JACM)
Algorithms for mutual exclusion
Algorithms for mutual exclusion
The information structure of distributed mutual exclusion algorithms
ACM Transactions on Computer Systems (TOCS)
A distributed algorithm for multiple entries to a critical section
Information Processing Letters
A simple taxonomy for distributed mutual exclusion algorithms
ACM SIGOPS Operating Systems Review
Another distributed algorithm for multiple entries to a critical section
Information Processing Letters
A taxonomy of distributed mutual exclusion
Journal of Parallel and Distributed Computing
A distributed k-mutual exclusion algorithm using k-coterie
Information Processing Letters
A bounded first-in, first-enabled solution to the l-exclusion problem
ACM Transactions on Programming Languages and Systems (TOPLAS)
Distributed algorithms for multiple entries to a critical section with priority
Information Processing Letters
A N algorithm for mutual exclusion in decentralized systems
ACM Transactions on Computer Systems (TOCS)
Asynchronous group mutual exclusion (extended abstract)
PODC '98 Proceedings of the seventeenth annual ACM symposium on Principles of distributed computing
A quorum based k-mutual exclusion by weighted k-quorum systems
Information Processing Letters
A simple local-spin group mutual exclusion algorithm
Proceedings of the eighteenth annual ACM symposium on Principles of distributed computing
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
Communicating sequential processes
Communications of the ACM
Concurrent control with “readers” and “writers”
Communications of the ACM
A note on group mutual exclusion
Proceedings of the twentieth annual ACM symposium on Principles of distributed computing
Distributed Algorithms
A distributed K-mutual exclusion algorithm
ICDCS '95 Proceedings of the 15th International Conference on Distributed Computing Systems
Quorum-Based Algorithms for Group Mutual Exclusion
IEEE Transactions on Parallel and Distributed Systems
A priority-based distributed group mutual exclusion algorithm when group access is non-uniform
Journal of Parallel and Distributed Computing
A Quorum-Based Group Mutual Exclusion Algorithm for a Distributed System with Dynamic Group Set
IEEE Transactions on Parallel and Distributed Systems
Group mutual exclusion algorithms based on ticket orders
COCOON'03 Proceedings of the 9th annual international conference on Computing and combinatorics
Hi-index | 0.01 |
Group mutual exclusion occurs naturally in situations where a resource can be shared by processes of the same group, but not by processes of different groups. For example, suppose data is stored in a CD-jukebox. Then when a disc is loaded for access, users that need data on the disc can concurrently access the disc, while users that need data on a different disc have to wait until the current disc is unloaded.The design issues for group mutual exclusion have been modeled as the Congenial Talking Philosophers problem, and solutions for shared-memory models have been proposed [12, 14]. As in ordinary mutual exclusion and many other problems in distributed systems, however, techniques developed for shared memory do not necessary apply to message passing (and vice versa). So in this paper we investigate solutions for Congenial Talking Philosophers in computer networks where processes communicate by asynchronous message passing. We first present a solution that is a straightforward adaptation from Ricart and Agrawala's algorithm for ordinary mutual exclusion. Then we show that the simple modification suffers a severe performance degradation that could cause the system to behave as though only one process of a group can be in the critical section at a time. We then Present a more efficient and highly concurrent distributed algorithm for the problem, the first such solution in computer networks.