The mutual exclusion problem: part I—a theory of interprocess communication
Journal of the ACM (JACM)
A fast mutual exclusion algorithm
ACM Transactions on Computer Systems (TOCS)
ACM Transactions on Programming Languages and Systems (TOPLAS)
A first-come-first-served mutual-exclusion algorithm with small communication variables
ACM Transactions on Programming Languages and Systems (TOPLAS)
Asynchronous group mutual exclusion (extended abstract)
PODC '98 Proceedings of the seventeenth annual ACM symposium on Principles of distributed computing
A simple local-spin group mutual exclusion algorithm
Proceedings of the eighteenth annual ACM symposium on Principles of distributed computing
A new solution of Dijkstra's concurrent programming problem
Communications of the ACM
Solution of a problem in concurrent programming control
Communications of the ACM
Complexity of communication among asynchronous parallel processes
Complexity of communication among asynchronous parallel processes
A simple group mutual l-exclusion algorithm
Information Processing Letters
Quorum-Based Algorithms for Group Mutual Exclusion
DISC '01 Proceedings of the 15th International Conference on Distributed Computing
The congenial talking philosophers problem in computer networks
Distributed Computing
Quorum-Based Algorithms for Group Mutual Exclusion
IEEE Transactions on Parallel and Distributed Systems
Proceedings of the twenty-second annual symposium on Principles of distributed computing
Mutual exclusion in asynchronous systems with failure detectors
Journal of Parallel and Distributed Computing
Space-efficient FCFS group mutual exclusion
Information Processing Letters
A Quorum-Based Group Mutual Exclusion Algorithm for a Distributed System with Dynamic Group Set
IEEE Transactions on Parallel and Distributed Systems
A Group k-Mutual Exclusion Algorithm for Mobile Ad Hoc Networks
IWANN '09 Proceedings of the 10th International Work-Conference on Artificial Neural Networks: Part II: Distributed Computing, Artificial Intelligence, Bioinformatics, Soft Computing, and Ambient Assisted Living
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
Group mutual exclusion in O(log n) RMR
Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Constant RMR solutions to reader writer synchronization
Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing
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
A group quorum system of degree 1+√1+n/m
ICDCN'06 Proceedings of the 8th international conference on Distributed Computing and Networking
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 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
Abortable reader-writer locks are no more complex than abortable mutex locks
DISC'12 Proceedings of the 26th international conference on Distributed Computing
Hi-index | 0.00 |
Group mutual exclusion is a natural problem, formulated by Joung in 1998, that generalises the classical mutual exclusion problem. In group mutual exclusion a process requests a “session” before entering its critical section; processes are allowed to be in the critical section simultaneously provided they have requested the same session. To rule out solutions that cause processes to delay each other even when they all request the same session, group mutual exclusion algorithms must satisfy a property called “concurrent entering”. Joung stated this property only informally. Keane and Moir later gave a precise statement of this property and devised a simple group mutual exclusion algorithm that satisfies it.We argue that Keane and Moir's formulation is not quite as strong as the property Joung described informally. We propose a new precise and simple formulation of concurrent entering that is stronger than Keane and Moir's and properly captures Joung's intention. Keane and Moir's algorithm does not satisfy this stronger property, while Joung's original algorithm does. We present another algorithm that satisfies this stronger property and has some advantages over Joung's.