The drinking philosophers problem
ACM Transactions on Programming Languages and Systems (TOPLAS) - Lecture notes in computer science Vol. 174
Algorithms for mutual exclusion
Algorithms for mutual exclusion
Concurrency control and recovery in database systems
Concurrency control and recovery in database systems
Local atomicity properties: modular concurrency control for abstract data types
ACM Transactions on Programming Languages and Systems (TOPLAS)
Principles of concurrent and distributed programming
Principles of concurrent and distributed programming
ACM Transactions on Programming Languages and Systems (TOPLAS)
A methodology for implementing highly concurrent data objects
ACM Transactions on Programming Languages and Systems (TOPLAS)
A bounded first-in, first-enabled solution to the l-exclusion problem
ACM Transactions on Programming Languages and Systems (TOPLAS)
On optimistic methods for concurrency control
ACM Transactions on Database Systems (TODS)
The serializability of concurrent database updates
Journal of the ACM (JACM)
Locking Primitives in a Database System
Journal of the ACM (JACM)
Universal Constructions for Large Objects
IEEE Transactions on Parallel and Distributed Systems
Concurrent Reading While Writing
ACM Transactions on Programming Languages and Systems (TOPLAS)
The notions of consistency and predicate locks in a database system
Communications of the ACM
Further comments on Dijkstra's concurrent programming control problem
Communications of the ACM
Concurrent control with “readers” and “writers”
Communications of the ACM
Additional comments on a problem in concurrent programming control
Communications of the ACM
Distributed Algorithms
Operating System Concepts, 4th Ed.
Operating System Concepts, 4th Ed.
The Performance of Protocols Based on Locks with Ordered Sharing
IEEE Transactions on Knowledge and Data Engineering
Proceedings of the twenty-second annual symposium on Principles of distributed computing
Shared-memory mutual exclusion: major research trends since 1986
Distributed Computing - Papers in celebration of the 20th anniversary of PODC
Speedup of Vidyasankar's algorithm for the group k-exclusion problem
Information Processing Letters - Devoted to the rapid publication of short contributions to information processing
Space-efficient FCFS group mutual exclusion
Information Processing Letters
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
Brief Announcement: Local-Spin Algorithms for Abortable Mutual Exclusion and Related Problems
DISC '08 Proceedings of the 22nd international symposium on Distributed Computing
Space-efficient FCFS group mutual exclusion
Information Processing Letters
Group mutual exclusion algorithms based on ticket orders
COCOON'03 Proceedings of the 9th annual international conference on Computing and combinatorics
A token-based distributed algorithm for the generalized resource allocation problem
OPODIS'10 Proceedings of the 14th international conference on Principles of distributed systems
A complexity separation between the cache-coherent and distributed shared memory models
Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Self-stabilizing synchronization in mobile sensor networks with covering
DCOSS'10 Proceedings of the 6th IEEE international conference on Distributed Computing in Sensor Systems
Self-stabilizing mutual exclusion and group mutual exclusion for population protocols with covering
OPODIS'11 Proceedings of the 15th international conference on Principles of Distributed Systems
A gossip-based mutual exclusion algorithm for cloud environments
GPC'12 Proceedings of the 7th international conference on Advances in Grid and Pervasive Computing
A regular group quorum system of degree ⌈√n/2⌉
ICA3PP'12 Proceedings of the 12th international conference on Algorithms and Architectures for Parallel Processing - Volume Part II
| Hi-index | 0.00 |
Mutual exclusion and concurrency are two fundamental and essentially opposite features in distributed systems. However, in some applications such as Computer Supported Cooperative Work (CSCW) we have found it necessary to impose mutual exclusion on different groups of processes in accessing a resource, while allowing processes of the same group to share the resource. To our knowledge, no such design issue has been previously raised in the literature.In this paper we address this issue by presenting a new problem, called Congenial Talking Philosophers, to model group mutual exclusion. We also propose several criteria to evaluate solutions of the problem and to measure their performance. Finally, we provide an efficient and highly concurrent distributed algorithm for the problem in a shared-memory model where processes communicate by reading from and writing to shared variables. The distributed algorithm meets the proposed criteria, and has performance similar to some naive but centralized solutions to the problem.